Majority voting on restricted domains

Department of Government, London School of Economics and Political Science (2007)
  Copy   BIBTEX

Abstract

In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments su¢ - cient for consistent majority judgments. Some are based on global orders of propositions or individuals, others on local orders, still others not on orders at all. Some generalize classic social-choice-theoretic domain conditions, others have no counterpart. Our most general condition gen- eralizes Sen’s triplewise value-restriction, itself the most general classic condition. We also prove a new characterization theorem: for a large class of domains, if there exists any aggregation function satisfying some democratic conditions, then majority voting is the unique such function. Taken together, our results provide new support for the robustness of majority rule.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

External links

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

Through your library

Analytics

Added to PP
2024-09-28

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author Profiles

Franz Dietrich
Centre National de la Recherche Scientifique
Christian List
Ludwig Maximilians Universität, München

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references