Strategy-Proof Judgment Aggregation
Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy.
Volume (Year): 23 (2007)
Issue (Month): 03 (November)
|Contact details of provider:|| Postal: Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK|
Web page: http://journals.cambridge.org/jid_EAP
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Christian List, 2005. "The probability of inconsistencies in complex collective decisions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 24(1), pages 3-32, 05.
- Franz Dietrich & Christian List, 2005.
"Arrow’s theorem in judgment aggregation,"
STICERD - Political Economy and Public Policy Paper Series
13, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
- Franz Dietrich & Christian List, 2005. "Arrow’s theorem in judgment aggregation," Levine's Bibliography 784828000000000546, UCLA Department of Economics.
- Franz Dietrich & Christian List, 2005. "Arrow’s theorem in judgment aggregation," LSE Research Online Documents on Economics 19295, London School of Economics and Political Science, LSE Library.
- Franz Dietrich & Christian List, 2005. "Arrow's Theorem in Judgement Aggregation," Public Economics 0504007, EconWPA, revised 10 Sep 2005.
- Franz Dietrich, 2007.
"A generalised model of judgment aggregation,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 529-565, June.
- List, Christian & Pettit, Philip, 2002. "Aggregating Sets of Judgments: An Impossibility Result," Economics and Philosophy, Cambridge University Press, vol. 18(01), pages 89-110, April.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- Wilson, Robert, 1975. "On the theory of aggregation," Journal of Economic Theory, Elsevier, vol. 10(1), pages 89-99, February.
- Barbera, Salvador & Masso, Jordi & Neme, Alejandro, 1997.
"Voting under Constraints,"
Journal of Economic Theory,
Elsevier, vol. 76(2), pages 298-321, October.
- Dietrich, Franz, 2006. "Judgment aggregation: (im)possibility theorems," Journal of Economic Theory, Elsevier, vol. 126(1), pages 286-298, January.
- Dryzek, John S. & List, Christian, 2003. "Social Choice Theory and Deliberative Democracy: A Reconciliation," British Journal of Political Science, Cambridge University Press, vol. 33(01), pages 1-28, January.
- Nick Baigent, 1987. "Preference Proximity and Anonymous Social Choice," The Quarterly Journal of Economics, Oxford University Press, vol. 102(1), pages 161-169.
- Nehring, Klaus, 2003. "Arrow's theorem as a corollary," Economics Letters, Elsevier, vol. 80(3), pages 379-382, September.
- Barbera, S. & Gul, F. & Stacchetti, E., 1992.
"Generalized Median Voter Schemes and Committees,"
UFAE and IAE Working Papers
184.92, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Alejandro Saporiti, 2007.
"Strategy-Proofness and Single-Crossing,"
Wallis Working Papers
WP48, University of Rochester - Wallis Institute of Political Economy.
- Christian List, 2002.
"A Possibility Theorem on Aggregation Over Multiple Interconnected Propositions,"
Economics Series Working Papers
123, University of Oxford, Department of Economics.
- List, Christian, 2003. "A possibility theorem on aggregation over multiple interconnected propositions," Mathematical Social Sciences, Elsevier, vol. 45(1), pages 1-13, February.
- Brams, Steven J. & Kilgour, D. Marc & Zwicker, William, 1997. "Voting on Referenda: The Separability Problem and Possible Solutions," Working Papers 97-15, C.V. Starr Center for Applied Economics, New York University.
- Brennan, Geoffrey, 2001. "Collective coherence?," International Review of Law and Economics, Elsevier, vol. 21(2), pages 197-211, June.
When requesting a correction, please mention this item's handle: RePEc:cup:ecnphi:v:23:y:2007:i:03:p:269-300_00. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Keith Waters)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.