Advanced Search
MyIDEAS: Login

Preference aggregation theory without acyclicity: The core without majority dissatisfaction

Contents:

Author Info

  • Kumabe, Masahiro
  • Mihara, H. Reiju

Abstract

Acyclicity of individual preferences is a minimal assumption in social choice theory. We replace that assumption by the direct assumption that preferences have maximal elements on a fixed agenda. We show that the core of a simple game is nonempty for all profiles of such preferences if and only if the number of alternatives in the agenda is less than the Nakamura number of the game. The same is true if we replace the core by the core without majority dissatisfaction, obtained by deleting from the agenda all the alternatives that are non-maximal for all players in a winning coalition. Unlike the core, the core without majority dissatisfaction depends only on the players' sets of maximal elements and is included in the union of such sets. A result for an extended framework gives another sense in which the core without majority dissatisfaction behaves better than the core.

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://www.sciencedirect.com/science/article/B6WFW-50GMMG3-1/2/07966976f4d5b874bfe72d0cc12e0a6a
Download Restriction: Full text for ScienceDirect subscribers only

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 Info

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 72 (2011)
Issue (Month): 1 (May)
Pages: 187-201

as in new window
Handle: RePEc:eee:gamebe:v:72:y:2011:i:1:p:187-201

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

Related research

Keywords: Core Nakamura number Kappa number Simple games Voting games Maximal elements Acyclic preferences Limit ordinals;

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. Truchon, M., 1993. "Voting Games and Acyclic Collective Choice Rules," Papers 9315, Laval - Recherche en Politique Economique.
  2. John Duggan, 2007. "A systematic approach to the construction of non-empty choice sets," Social Choice and Welfare, Springer, vol. 28(3), pages 491-506, April.
  3. Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.
  4. Lipman, Barton L, 1991. "How to Decide How to Decide How to. . . : Modeling Limited Rationality," Econometrica, Econometric Society, vol. 59(4), pages 1105-25, July.
  5. Mathieu Martin & Vincent Merlin, 2006. "On the Chacteristic Numbers of Voting Games," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 200609, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
  6. H. Reiju Mihara, 2000. "Coalitionally strategyproof functions depend only on the most-preferred alternatives," Social Choice and Welfare, Springer, vol. 17(3), pages 393-402.
  7. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Discussion Paper Series dp278, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  8. Attila Ambrus & Kareen Rozen, 2012. "Rationalizing Choice with Multi-Self Models," Levine's Working Paper Archive 786969000000000512, David K. Levine.
  9. Andjiga, N G & Moulen, J, 1989. "Necessary and Sufficient Conditions for l-Stability of Games in Constitutional Form," International Journal of Game Theory, Springer, vol. 18(1), pages 91-110.
  10. Andjiga, Nicolas Gabriel & Mbih, Boniface, 2000. "A note on the core of voting games," Journal of Mathematical Economics, Elsevier, vol. 33(3), pages 367-372, April.
  11. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer, vol. 31(4), pages 621-640, December.
  12. Attila Ambrus & Kareen Rozen, 2008. "Revealed Conflicting Preferences," Levine's Working Paper Archive 122247000000002161, David K. Levine.
  13. Andjiga, Nicolas Gabriel & Moyouwou, Issofa, 2006. "A note on the non-emptiness of the stability set when individual preferences are weak orders," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 67-76, July.
  14. 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.
  15. Banks, Jeffrey & Duggan, John & Le Breton, Michel, 2003. "Social Choice and Electoral Competition in the General Spatial Model," IDEI Working Papers 188, Institut d'Économie Industrielle (IDEI), Toulouse.
  16. Rubinstein, Ariel, 1980. "Stability of decision systems under majority rule," Journal of Economic Theory, Elsevier, vol. 23(2), pages 150-159, October.
  17. Banks, Jeffrey S., 1984. "Sophisticated Voting Outcomes and Agenda Control," Working Papers 524, California Institute of Technology, Division of the Humanities and Social Sciences.
  18. Elizabeth Penn, 2006. "The Banks Set in Infinite Spaces," Social Choice and Welfare, Springer, vol. 27(3), pages 531-543, December.
  19. Partha Dasgupta & Eric Maskin, 2008. "On The Robustness of Majority Rule," Journal of the European Economic Association, MIT Press, vol. 6(5), pages 949-973, 09.
  20. Le Breton, M & Salles, M, 1990. "The Stability Set of Voting Games: Classification and Genericity Results," International Journal of Game Theory, Springer, vol. 19(2), pages 111-27.
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. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.

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:eee:gamebe:v:72:y:2011:i:1:p:187-201

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).

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.