Mathematics Colloquia and Seminars
An Introduction to Voting MechanismsStudent-Run Applied & Math Seminar
|Speaker:||Joe Corliss, UC Davis Mathematics|
|Start time:||Fri, Apr 15 2016, 12:10PM|
Although elections form the backbone of democratic governments around the world, there is no consensus (academic or otherwise) on the best way to combine votes into a collective decision. First we define and analyze three of the most popular voting methods: plurality voting, instant-runoff voting, and the Borda count. After observing some non-intuitive behavior from these methods, we state the Gibbard-Satterthwaite theorem, which shows that a broad class of voting methods can be manipulated by voters. We then examine some more methods in light of this theorem: random ballot, approval voting, and range voting.
Please RSVP (optional, but encouraged!) at: https://docs.google.com/spreadsheets/d/1wyOmPJvaqsSngBuIcjnN3vLAWeRFTyru47HFaT0wlMc/edit#gid=1614490885