IDEAS home Printed from https://ideas.repec.org/a/eee/jeborg/v69y2009i1p17-26.html
   My bibliography  Save this article

The rationality/computability trade-off in finite games

Author

Listed:
  • Prasad, Kislaya

Abstract

The computability of Nash equilibrium points of finite strategic form games is examined. When payoffs are computable there always exists an equilibrium in which all players use computable strategies, but there can be no algorithm that, given an arbitrary strategic form game, can compute its Nash equilibrium point. This is a consequence of the fact, established in this paper, that there is a computable sequence of games for which the equilibrium points do not constitute a computable sequence. Even for games with computable equilibrium points, best response functions of the players need not be computable. In contrast, approximate equilibria and error-prone responses are computable.

Suggested Citation

  • Prasad, Kislaya, 2009. "The rationality/computability trade-off in finite games," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 17-26, January.
    • Handle: RePEc:eee:jeborg:v:69:y:2009:i:1:p:17-26
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-2681(08)00201-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Jordan J. S., 1993. "Three Problems in Learning Mixed-Strategy Nash Equilibria," Games and Economic Behavior, Elsevier, vol. 5(3), pages 368-386, July.
    2. Ellickson,Bryan, 1994. "Competitive Equilibrium," Cambridge Books, Cambridge University Press, number 9780521319881, September.
    3. McKelvey Richard D. & Palfrey Thomas R., 1995. "Quantal Response Equilibria for Normal Form Games," Games and Economic Behavior, Elsevier, vol. 10(1), pages 6-38, July.
    4. Prasad, Kislaya, 1997. "On the computability of Nash equilibria," Journal of Economic Dynamics and Control, Elsevier, vol. 21(6), pages 943-953, June.
    5. Kohlberg, Elon & Mertens, Jean-Francois, 1986. "On the Strategic Stability of Equilibria," Econometrica, Econometric Society, vol. 54(5), pages 1003-1037, September.
    6. Lewis, Alain A., 1988. "Lower bounds on degrees of game-theoretic structures," Mathematical Social Sciences, Elsevier, vol. 16(1), pages 1-39, August.
    7. Kislaya Prasad, 2004. "Observation, Measurement, and Computation in Finite Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(4), pages 455-470, August.
    8. Kam-Chau Wong & Marcel K. Richter, 1999. "Non-computability of competitive equilibrium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 14(1), pages 1-27.
    9. Vela Velupillai, K., 2002. "Effectivity and constructivity in economic theory," Journal of Economic Behavior & Organization, Elsevier, vol. 49(3), pages 307-325, November.
    10. Velupillai, K., 2000. "Computable Economics: The Arne Ryde Memorial Lectures," OUP Catalogue, Oxford University Press, number 9780198295273.
    11. Prasad, Kislaya, 1991. "Computability and randomness of Nash equilibrium in infinite games," Journal of Mathematical Economics, Elsevier, vol. 20(5), pages 429-442.
    12. Radner, Roy, 1980. "Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives," Journal of Economic Theory, Elsevier, vol. 22(2), pages 136-154, April.
    13. N. Sofronidis, 2004. "Undecidability of the existence of pure Nash equilibria," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(2), pages 423-428, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Blog mentions

    As found by EconAcademics.org, the blog aggregator for Economics research:
    1. Computability of Nash Equilibrium
      by Eran in The Leisure of the Theory Class on 2011-01-05 03:31:14

    Citations

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


    Cited by:

    1. Koppl, Roger, 2010. "Some epistemological implications of economic complexity," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 859-872, December.
    2. Hu, Tai-Wei, 2014. "Unpredictability of complex (pure) strategies," Games and Economic Behavior, Elsevier, vol. 88(C), pages 1-15.
    3. Halpern, Joseph Y. & Pass, Rafael, 2015. "Algorithmic rationality: Game theory with costly computation," Journal of Economic Theory, Elsevier, vol. 156(C), pages 246-268.

    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. Troy Tassier, 2013. "Handbook of Research on Complexity, by J. Barkley Rosser, Jr. and Edward Elgar," Eastern Economic Journal, Palgrave Macmillan;Eastern Economic Association, vol. 39(1), pages 132-133.
    2. Antonio Doria, Francisco, 2011. "J.B. Rosser Jr. , Handbook of Research on Complexity, Edward Elgar, Cheltenham, UK--Northampton, MA, USA (2009) 436 + viii pp., index, ISBN 978 1 84542 089 5 (cased)," Journal of Economic Behavior & Organization, Elsevier, vol. 78(1-2), pages 196-204, April.
    3. Dieter Balkenborg & Rosemarie Nagel, 2016. "An Experiment on Forward vs. Backward Induction: How Fairness and Level k Reasoning Matter," German Economic Review, Verein für Socialpolitik, vol. 17(3), pages 378-408, August.
    4. Kislaya Prasad, 2004. "Constructive and Classical Models for Results in Economics and Game Theory," Metroeconomica, Wiley Blackwell, vol. 55(2‐3), pages 141-154, May.
    5. Voorneveld, Mark, 2010. "The possibility of impossible stairways: Tail events and countable player sets," Games and Economic Behavior, Elsevier, vol. 68(1), pages 403-410, January.
    6. Philippe Jehiel, 2022. "Analogy-Based Expectation Equilibrium and Related Concepts:Theory, Applications, and Beyond," PSE Working Papers halshs-03735680, HAL.
    7. Giacomo Rubbini, 2023. "Mechanism Design without Rational Expectations," Papers 2305.07472, arXiv.org, revised Nov 2023.
    8. Simon P. Anderson & Jacob K. Goeree & Charles A. Holt, 2002. "The Logit Equilibrium: A Perspective on Intuitive Behavioral Anomalies," Southern Economic Journal, John Wiley & Sons, vol. 69(1), pages 21-47, July.
    9. Régis Breton & Bertrand Gobillard, 2005. "Robustness of equilibrium price dispersion in finite market games," Post-Print halshs-00257207, HAL.
    10. Christoph Kuzmics & Daniel Rodenburger, 2020. "A case of evolutionarily stable attainable equilibrium in the laboratory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 685-721, October.
    11. Zauner, Klaus G., 1999. "A Payoff Uncertainty Explanation of Results in Experimental Centipede Games," Games and Economic Behavior, Elsevier, vol. 26(1), pages 157-185, January.
    12. Gaffeo, E. & Catalano, M. & Clementi, F. & Delli Gatti, D. & Gallegati, M. & Russo, A., 2007. "Reflections on modern macroeconomics: Can we travel along a safer road?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 382(1), pages 89-97.
    13. Cooper, David J. & Van Huyck, John B., 2003. "Evidence on the equivalence of the strategic and extensive form representation of games," Journal of Economic Theory, Elsevier, vol. 110(2), pages 290-308, June.
    14. Crawford, Vincent P., 2018. "“Fatal Attraction” and Level-k thinking in games with Non-neutral frames," Journal of Economic Behavior & Organization, Elsevier, vol. 156(C), pages 219-224.
    15. Blavatskyy, Pavlo, 2018. "Oligopolistic price competition with a continuous demand," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 123-131.
    16. Wagner, Alexander K. & Granic, Dura-Georg, 2017. "Tie-Breaking Power in Committees," VfS Annual Conference 2017 (Vienna): Alternative Structures for Money and Banking 168187, Verein für Socialpolitik / German Economic Association.
    17. Ying-Fang Kao & Ragupathy Venkatachalam, 2021. "Human and Machine Learning," Computational Economics, Springer;Society for Computational Economics, vol. 57(3), pages 889-909, March.
    18. Battalio,R. & Samuelson,L. & Huyck,J. van, 1998. "Risk dominance, payoff dominance and probabilistic choice learning," Working papers 2, Wisconsin Madison - Social Systems.
    19. Govindan, Srihari & Wilson, Robert, 2004. "Computing Nash equilibria by iterated polymatrix approximation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1229-1241, April.
    20. Voorneveld, Mark, 2007. "The possibility of impossible stairways and greener grass," SSE/EFI Working Paper Series in Economics and Finance 673, Stockholm School of Economics.

    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:jeborg:v:69:y:2009:i:1:p:17-26. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jebo .

    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.