The complexity of computing best-response automata in repeated games
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 Theory.
Volume (Year): 45 (1988)
Issue (Month): 2 (August)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer, vol. 42(1), pages 193-236, January.
- 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.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research,
Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Daijiro Okada & Abraham Neyman, 2004. "Growing Strategy Sets in Repeated Games," Econometric Society 2004 North American Summer Meetings 625, Econometric Society.
- Gilboa Itzhak & Schmeidler David, 1994.
"Infinite Histories and Steady Orbits in Repeated Games,"
Games and Economic Behavior,
Elsevier, vol. 6(3), pages 370-399, May.
- 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.
- Olivier Compte & Andrew Postlewaite, 2010. "Plausible Cooperation,Third Version," PIER Working Paper Archive 13-008, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2012.
- Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Roy, Jaideep, . "Learning with bounded memory," Open Access publications from Universidad Carlos III de Madrid info:hdl:10016/7224, Universidad Carlos III de Madrid.
- 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.
- Holm, Hakan J., 1995. "Computational cost of verifying enforceable contracts," International Review of Law and Economics, Elsevier, vol. 15(2), pages 127-140, June.
- Fernando Oliveira, 2010. "Modeling Emotions and Reason in Agent-Based Systems," Computational Economics, Society for Computational Economics, vol. 35(2), pages 155-164, February.
- Lu Hong & Scott E. Page, 1998. "Diversity and Optimality," Research in Economics 98-08-077e, Santa Fe Institute.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.