Condorcet voting methods avoid the paradoxes of voting theory

Tiance Wang, John Sturm, Paul Cuff, Sanjeev Kulkarni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Democratically choosing a single preference from more than two candidate options is not a straightforward matter. In fact, voting theory has established a number of paradoxes which assert seemingly innocuous attributes to be incompatible. One of the most desirable attributes - independence of irrelevant alternatives - is proven by Arrow to be incompatible (in a worst-case sense) with nominal fairness constraint. Another theorem states that all voting systems will have opportunities for a voter to improve their outcome by voting contrary to their true preferences. What we show in this work is that Condorcet methods, which uniquely satisfy the independent of irrelevant alternatives property whenever possible, actually avoids these paradoxes both in practice (based on real data) and in theory (in a probabilistic sense).

Original languageEnglish (US)
Title of host publication2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages201-203
Number of pages3
DOIs
StatePublished - Dec 1 2012
Event2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States
Duration: Oct 1 2012Oct 5 2012

Publication series

Name2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Other

Other2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
CountryUnited States
CityMonticello, IL
Period10/1/1210/5/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Wang, T., Sturm, J., Cuff, P., & Kulkarni, S. (2012). Condorcet voting methods avoid the paradoxes of voting theory. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 (pp. 201-203). [6483218] (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012). https://doi.org/10.1109/Allerton.2012.6483218