Advanced Search
MyIDEAS: Login to save this paper or follow this series

Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof

Contents:

Author Info

  • H. Reiju Mihara

    (Kagawa University)

Abstract

This 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 Info

If 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.
File URL: http://128.118.178.162/eps/pe/papers/9604/9604002.pdf
Download Restriction: no

Bibliographic Info

Paper provided by EconWPA in its series Public Economics with number 9604002.

as in new window
Length:
Date of creation: 24 Apr 1996
Date of revision: 20 Sep 1996
Handle: RePEc:wpa:wuwppe:9604002

Note: Social Choice and Welfare (2001) 18: 543|553
Contact details of provider:
Web page: http://128.118.178.162

Related research

Keywords: 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:

Find related papers by JEL classification:

References

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.:
as in new window
  1. Lauwers, Luc & Van Liedekerke, Luc, 1995. "Ultraproducts and aggregation," Journal of Mathematical Economics, Elsevier, vol. 24(3), pages 217-237.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
  2. Torres, Ricard, 2005. "Limiting Dictatorial rules," Journal of Mathematical Economics, Elsevier, vol. 41(7), pages 913-935, November.
  3. 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.
  4. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer, vol. 10(2), pages 257-276.
  5. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wpa:wuwppe:9604002. 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: (EconWPA).

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.