On the computability of Nash equilibria
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Economic Dynamics and Control.
Volume (Year): 21 (1997)
Issue (Month): 6 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jedc
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Prasad, Kislaya, 1991. "Computability and randomness of Nash equilibrium in infinite games," Journal of Mathematical Economics, Elsevier, vol. 20(5), pages 429-442.
- Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
- Prasad, K., 1996. "Some Results on the Constructive Existence of Equilibrium in Finite Games," Working Papers 1996_06_02, Department of Economics, Florida State University.
- Joshua M. Epstein & Ross A. Hammond, 2001. "Non-Explanatory Equilibria: An Extremely Simple Game With (Mostly) Unattainable Fixed Points," Working Papers 01-08-043, Santa Fe Institute.
- 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.
- Joshua M. Epstein, 2007.
"Agent-Based Computational Models and Generative Social Science
[Generative Social Science Studies in Agent-Based Computational Modeling]," Introductory Chapters, Princeton University Press.
- Prasad, Kislaya, 2009. "The rationality/computability trade-off in finite games," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 17-26, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.