IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v60y1992i4p877-88.html
   My bibliography  Save this article

Rationality, Computability, and Nash Equilibrium

Author

Listed:
  • Canning, David

Abstract

Suppose two agents play a game, each using a computable algorithm to decide what to do, these algorithms being common knowledge. The author shows that it is possible to act rationally provided he limits his attention to a natural subset of solvable games and to opponents who use rational algorithms; the outcome is a Nash equilibrium. Going further, the author shows that rationality is possible on many domains of games and opposing algorithms but each domain requires a particular solution algorithm; no one algorithm is rational on all possible domains. Copyright 1992 by The Econometric Society.

Suggested Citation

  • Canning, David, 1992. "Rationality, Computability, and Nash Equilibrium," Econometrica, Econometric Society, vol. 60(4), pages 877-888, July.
    • Handle: RePEc:ecm:emetrp:v:60:y:1992:i:4:p:877-88
    as

    Download full text from publisher

    File URL: http://links.jstor.org/sici?sici=0012-9682%28199207%2960%3A4%3C877%3ARCANE%3E2.0.CO%3B2-6&origin=repec
    File Function: full text
    Download Restriction: Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.
    ---><---

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

    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, 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. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    3. Koppl, Roger, 2010. "Some epistemological implications of economic complexity," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 859-872, December.
    4. David Levine & Balázs Szentes, 2006. "Can A Turing Player Identify Itself?," Economics Bulletin, AccessEcon, vol. 1(1), pages 1-6.
    5. Siegfried Berninghaus & Werner G³th & Hartmut Kliemt, 2003. "Reflections on Equilibrium: Ideal Rationality and Analytic Decomposition of Games," Homo Oeconomicus, Institute of SocioEconomics, vol. 20, pages 257-302.
    6. William R. Zame & John H. Nachbar, 1996. "Non-computable strategies and discounted repeated games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122.
    7. Horaguchi, Haruo, 1996. "The role of information processing cost as the foundation of bounded rationality in game theory," Economics Letters, Elsevier, vol. 51(3), pages 287-294, June.
    8. Richter, Marcel K. & Wong, Kam-Chau, 1999. "Computable preference and utility," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 339-354, November.
    9. repec:ebl:ecbull:v:1:y:2006:i:1:p:1-6 is not listed on IDEAS
    10. 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.

    More about this item

    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:ecm:emetrp:v:60:y:1992:i:4:p:877-88. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    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.