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 "describable." The "describable" 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 18 (2001)
Issue (Month): 3 ()
Note: Received: 10 August 1998/Accepted: 29 February 2000
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
Other versions of this item:
- H. Reiju Mihara, 1996. "Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof," Public Economics 9604002, EconWPA, revised 20 Sep 1996.
- 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.
- H. Reiju Mihara, 1994.
"Arrow's Theorem and Turing Computability,"
9408001, EconWPA, revised 23 Aug 1994.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.
- Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
- 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: (Guenther Eichhorn) or (Christopher F Baum).
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.