Advanced Search
MyIDEAS: Login to save this article or follow this journal

The complexity of computing best-response automata in repeated games

Contents:

Author Info

  • Gilboa, Itzhak

Abstract

No abstract is available for this item.

Download Info

If 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.
File URL: http://www.sciencedirect.com/science/article/B6WJ3-4CYH4GT-4C/2/93bb3c8d213a198ac116a5badba57192
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 under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal Journal of Economic Theory.

Volume (Year): 45 (1988)
Issue (Month): 2 (August)
Pages: 342-352

as in new window
Handle: RePEc:eee:jetheo:v:45:y:1988:i:2:p:342-352

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869

Related research

Keywords:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

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

Cited by:
  1. Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1989. "The Complexity of Eliminating Dominated Strategies," Discussion Papers 853, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  2. Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
  3. Daijiro Okada & Abraham Neyman, 2004. "Growing Strategy Sets in Repeated Games," Econometric Society 2004 North American Summer Meetings 625, Econometric Society.
  4. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer, vol. 42(3), pages 593-611, August.
  5. Holm, Hakan J., 1995. "Computational cost of verifying enforceable contracts," International Review of Law and Economics, Elsevier, vol. 15(2), pages 127-140, June.
  6. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
  7. Itzhak Gilboa & David Schmeidler, 1989. "Infinite Histories and Steady Orbits in Repeated Games," Discussion Papers 846, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  8. Fernando Oliveira, 2010. "Modeling Emotions and Reason in Agent-Based Systems," Computational Economics, Society for Computational Economics, vol. 35(2), pages 155-164, February.
  9. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  10. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  11. D. Sgroi & D. J. Zizzo, 2002. "Strategy Learning in 3x3 Games by Neural Networks," Cambridge Working Papers in Economics 0207, Faculty of Economics, University of Cambridge.
  12. Lu Hong & Scott E. Page, 1998. "Diversity and Optimality," Research in Economics 98-08-077e, Santa Fe Institute.
  13. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer, vol. 42(1), pages 193-236, January.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:45:y:1988:i:2:p:342-352. 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: (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.