IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v47y2011i2p150-158.html
   My bibliography  Save this article

Computability of simple games: A complete investigation of the sixty-four possibilities

Author

Listed:
  • Kumabe, Masahiro
  • Mihara, H. Reiju

Abstract

Abstract Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axioms.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:mateco:v:47:y:2011:i:2:p:150-158
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406811000073
    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 below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Nabil I. Al-Najjar & Luca Anderlini & Leonardo Felli, 2006. "Undescribable Events," Review of Economic Studies, Oxford University Press, vol. 73(4), pages 849-868.
    2. Peleg,Bezalel, 2008. "Game Theoretic Analysis of Voting in Committees," Cambridge Books, Cambridge University Press, number 9780521074650.
    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. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    5. 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.
    6. Luca Anderlini & Leonardo Felli, 1994. "Incomplete Written Contracts: Undescribable States of Nature," The Quarterly Journal of Economics, Oxford University Press, vol. 109(4), pages 1085-1124.
    7. 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.
    8. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.
    9. Shanfeng Zhu & Xiaotie Deng & Maocheng Cai & Qizhi Fang, 2002. "On computational complexity of membership test in flow games and linear production games," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(1), pages 39-45.
    10. Richter, Marcel K. & Wong, Kam-Chau, 1999. "Computable preference and utility," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 339-354, November.
    11. 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.
    12. Kelly, Jerry S., 1988. "Social choice and computational complexity," Journal of Mathematical Economics, Elsevier, vol. 17(1), pages 1-8, February.
    13. Anthony Downs, 1957. "An Economic Theory of Political Action in a Democracy," Journal of Political Economy, University of Chicago Press, vol. 65, pages 135-135.
    14. 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.
    15. Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2006. "Social choice and electoral competition in the general spatial model," Journal of Economic Theory, Elsevier, vol. 126(1), pages 194-234, January.
    16. 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.
    17. William Thomson, 2001. "On the axiomatic method and its recent applications to game theory and resource allocation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(2), pages 327-386.
    18. 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. 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.
    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.

    More about this item

    Keywords

    Voting games Axiomatic method Complete independence Turing computability Multi-criterion decision-making;

    JEL classification:

    • D90 - Microeconomics - - Micro-Based Behavioral Economics - - - General
    • 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:eee:mateco:v:47:y:2011:i:2:p:150-158. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.