Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof
AbstractThis paper gives a concrete example of a nondictatorial, coalitionally strategyproof social choice function for countably infinite societies. The function is defined for those profiles such that for each alternative, the coalition that prefers it the most is gdescribable.h The gdescribableh coalitions are assumed to form a countable Boolean algebra. The paper discusses oligarchical characteristics of the function, employing a specific interpretation of an infinite society. The discussion clarifies within a single framework a connection between the negative result (the Gibbard-Satterthwaite theorem) for finite societies and the positive result for infinite ones.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by EconWPA in its series Public Economics with number 9604002.
Date of creation: 24 Apr 1996
Date of revision: 20 Sep 1996
Note: Social Choice and Welfare (2001) 18: 543|553
Contact details of provider:
Web page: http://184.108.40.206
Gibbard-Satterthwaite theorem; cheatproofness; dominant strategy implementation; strategy-proof social choice functions; plurality rule; infinitely large societies; countable Boolean algebras of coalitions; free ultrafilters; models of knowledge; partitional information functions.;
Other versions of this item:
- H. Reiju Mihara, 2001. "Existence of a coalitionally strategyproof social choice function: A constructive proof," Social Choice and Welfare, Springer, vol. 18(3), pages 543-553.
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D80 - Microeconomics - - Information, Knowledge, and Uncertainty - - - General
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.:
- Lauwers, Luc & Van Liedekerke, Luc, 1995. "Ultraproducts and aggregation," Journal of Mathematical Economics, Elsevier, vol. 24(3), pages 217-237.
- H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006.
"Computability of simple games: A characterization and application to the core,"
437, University Library of Munich, Germany.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
- Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
- H. Reiju Mihara, 1997.
"Arrow's Theorem and Turing computability,"
Springer, vol. 10(2), pages 257-276.
- Torres, Ricard, 2005. "Limiting Dictatorial rules," Journal of Mathematical Economics, Elsevier, vol. 41(7), pages 913-935, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).
If references are entirely missing, you can add them using this form.