Some Remarks on Dodgson's Voting Rule

Mathematical Logic Quarterly 55 (4):460-463 (2009)
  Copy   BIBTEX

Abstract

Sparked by a remarkable result due to Hemaspaandra et al. [9], the voting rule attributed to Charles Dodgson has become one of the most studied voting rules in computational social choice. However, the computer science literature often neglects that Dodgson's rule has some serious shortcomings as a choice procedure. This short note contains four examples revealing Dodgson's deficiencies

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Voting the General Will.Melissa Schwartzberg - 2008 - Political Theory 36 (3):403-423.
Strategic Voting Under Uncertainty About the Voting Method.Wesley H. Holliday & Eric Pacuit - 2019 - Electronic Proceedings in Theoretical Computer Science 297:252–272.
The (severe) limits of deliberative democracy as the basis for political choice.Gerald F. Gaus - 2008 - Theoria: A Journal of Social and Political Theory 55 (117):26-53.
The Limits of Deliberative Democracy as the Basis for Political Choice.Gerald Gaus - 2008 - Theoria: A Journal of Social and Political Theory 55:26-53.
Voting by Eliminating Quantifiers.Dov M. Gabbay & Andrzej Szałas - 2009 - Studia Logica 92 (3):365-379.
Special majorities rationalized.Robert E. Goodin & Christian List - 2006 - British Journal of Political Science 36 (2):213-241.

Analytics

Added to PP
2013-12-01

Downloads
3 (#1,729,579)

6 months
17 (#161,763)

Historical graph of downloads
How can I increase my downloads?