5th Year Master's Thesis Presentation - Russell Emerine

— 4:30pm

Location:
In Person and Virtual - ET - Gates Hillman 7101 and Zoom

Speaker:
RUSSELL EMERINE , Master's Student
Computer Science Department
Carnegie Mellon University
https://www.linkedin.com/in/russell-emerine-b2583a210

Simulating Voting Systems

Much of the past work on voting systems focuses on ranked voting systems, which have a number of limitations such as Arrow's Theorem. In this paper we consider ranked voting systems as well as the less commonly used class of rated voting systems. The systems differ in that ranked voting systems only allow the voter to order the candidates, while in rated voting systems the voter can score each candidate independently. In 2000, Warren Smith evaluated ranked and rated voting systems under a Monte Carlo simulation model of voter utilities and behaviors. We replicate Smith's results with a wider selection of voting systems and voter utility distributions and conclude that range voting, a rated system where each candidate can be independently scored in the range [0, 1], has the best performance.

Thesis Committee
Daniel Sleator (Chair)
Fei Fang

Additional Information 
 

For More Information:
tracyf@cs.cmu.edu

Add event to Google
Add event to iCal