Rationality, Computability, and Nash Equilibrium
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- 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.
- 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.
- Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
- 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.
- Richter, Marcel K. & Wong, Kam-Chau, 1999. "Computable preference and utility," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 339-354, November.
- David Levine & Balázs Szentes, 2006. "Can A Turing Player Identify Itself?," Economics Bulletin, AccessEcon, vol. 1(1), pages 1-6.
- Koppl, Roger, 2010. "Some epistemological implications of economic complexity," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 859-872, December.
- repec:ebl:ecbull:v:1:y:2006:i:1:p:1-6 is not listed on IDEAS
- Nachbar, John H & Zame, William R, 1996.
"Non-computable Strategies and Discounted Repeated Games,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
- 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.
- William R. Zame, 1995. "Non-Computable Strategies and Discounted Repeated Games," UCLA Economics Working Papers 735, UCLA Department of Economics.
- Siegfried Berninghaus & Werner G³th & Hartmut Kliemt, 2003.
"Reflections on Equilibrium: Ideal Rationality and Analytic Decomposition of Games,"
Institute of SocioEconomics, vol. 20, pages 257-302.
- Siegfried Berninghaus & Werner Güth & Hartmut Kliemt, "undated". "Reflections on Equilibrium - Ideal Rationality and Analytic Decomposition of Games," Papers on Strategic Interaction 2003-08, Max Planck Institute of Economics, Strategic Interaction Group.
- 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
StatisticsAccess and download statistics
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum). General contact details of provider: http://edirc.repec.org/data/essssea.html .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.