IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v31y2008i4p621-640.html
   My bibliography  Save this article

The Nakamura numbers for computable simple games

Author

Listed:
  • Masahiro Kumabe
  • H. Reiju Mihara

Abstract

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game impose on its Nakamura number. We find that a computable game has a finite Nakamura number greater than three only if it is proper, nonstrong, and nonweak, regardless of whether it is monotonic or whether it has a finite carrier. The lack of strongness often results in alternatives that cannot be strictly ranked.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    • Handle: RePEc:spr:sochwe:v:31:y:2008:i:4:p:621-640
    DOI: 10.1007/s00355-008-0300-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00355-008-0300-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00355-008-0300-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Peleg,Bezalel, 2008. "Game Theoretic Analysis of Voting in Committees," Cambridge Books, Cambridge University Press, number 9780521074650.
    2. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    3. Lewis, Alain A., 1988. "An infinite version of arrow's theorem in the effective setting," Mathematical Social Sciences, Elsevier, vol. 16(1), pages 41-48, August.
    4. Truchon M., 1996. "Voting games and acyclic collective choice rules," Mathematical Social Sciences, Elsevier, vol. 31(1), pages 55-55, February.
    5. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
    6. Rajat Deb, 2004. "Rights as alternative game forms," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 22(1), pages 83-111, February.
    7. Kolpin, Van, 1990. "Equivalent game forms and coalitional power," Mathematical Social Sciences, Elsevier, vol. 20(3), pages 239-249, December.
    8. 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.
    9. Richter, Marcel K. & Wong, Kam-Chau, 1999. "Computable preference and utility," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 339-354, November.
    10. Kelly, Jerry S., 1988. "Social choice and computational complexity," Journal of Mathematical Economics, Elsevier, vol. 17(1), pages 1-8, February.
    11. 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.
    12. K. J. Arrow & A. K. Sen & K. Suzumura (ed.), 2002. "Handbook of Social Choice and Welfare," Handbook of Social Choice and Welfare, Elsevier, edition 1, volume 1, number 1.
    13. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
    14. Weber, Robert J., 1994. "Games in coalitional form," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 36, pages 1285-1303, Elsevier.
    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


    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. 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.
    3. Josep Freixas & Sascha Kurz, 2019. "Bounds for the Nakamura number," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(4), pages 607-634, April.
    4. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
    5. Koji Takamiya & Akira Tanaka, 2016. "Computational complexity in the design of voting rules," Theory and Decision, Springer, vol. 80(1), pages 33-41, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
    3. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    4. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, University Library of Munich, Germany, revised 01 Jun 2004.
    5. Mihara, H. Reiju, 1999. "Arrow's theorem, countably many agents, and more visible invisible dictators1," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 267-287, November.
    6. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    7. Kretz, Claudio, 2021. "Consistent rights on property spaces," Journal of Economic Theory, Elsevier, vol. 197(C).
    8. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
    9. Ian Ayres & Colin Rowat & Nasser Zakariya, 2011. "Optimal voting rules for two-member tenure committees," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(2), pages 323-354, February.
    10. Sebastian Bervoets, 2010. "An axiomatic approach to predictability of outcomes in an interactive setting," Theory and Decision, Springer, vol. 68(3), pages 311-323, March.
    11. Lombardi, Michele & Yoshihara, Naoki, 2016. "Partially-honest Nash Implementation with Non-connected Honesty Standards," Discussion Paper Series 633, Institute of Economic Research, Hitotsubashi University.
    12. Murat R. Sertel & M. Remzi Sanver, 2004. "Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 22(2), pages 331-347, April.
    13. Leo Katz & Alvaro Sandroni, 2020. "Limits on power and rationality," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(2), pages 507-521, March.
    14. Thibault Gajdos & John Weymark, 2005. "Multidimensional generalized Gini indices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 26(3), pages 471-496, October.
    15. List, Christian & Polak, Ben, 2010. "Introduction to judgment aggregation," Journal of Economic Theory, Elsevier, vol. 145(2), pages 441-466, March.
    16. Guido Bonatti & Enrico Ivaldi, 2016. "Un indicatore per la misurazione della partecipazione culturale e sociale nelle regioni italiane," ECONOMIA E DIRITTO DEL TERZIARIO, FrancoAngeli Editore, vol. 2016(2), pages 283-302.
    17. Reiko Gotoh & Naoki Yoshihara, 2018. "Securing basic well-being for all," Review of Social Economy, Taylor & Francis Journals, vol. 76(4), pages 422-452, October.
    18. Erik Ansink & Hans-Peter Weikard, 2012. "Sequential sharing rules for river sharing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(2), pages 187-210, February.
    19. Hitoshi Matsushima, 2003. "Implementation and Preference for Honesty," CIRJE F-Series CIRJE-F-244, CIRJE, Faculty of Economics, University of Tokyo.
    20. Jingyi Xue, 2018. "Fair division with uncertain needs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 105-136, June.

    More about this item

    JEL classification:

    • C69 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Other
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:31:y:2008:i:4:p:621-640. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.