Complexity and Effective Prediction
Author
Abstract
Suggested Citation
Download full text from publisher
Other versions of this item:
- Neyman, Abraham & Spencer, Joel, 2010. "Complexity and effective prediction," Games and Economic Behavior, Elsevier, vol. 69(1), pages 165-168, May.
References listed on IDEAS
- Abraham Neyman, 2008.
"Learning Effectiveness and Memory Size,"
Discussion Paper Series
dp476, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000001945, David K. Levine.
- Abraham Neyman, 1998. "Finitely Repeated Games with Finite Automata," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 513-552, August.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 309-325.
- Ben-Porath Elchanan, 1993.
"Repeated Games with Finite Automata,"
Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Ben-Porath, E., 1991. "Repeated games with Finite Automata," Papers 7-91, Tel Aviv - the Sackler Institute of Economic Studies.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Abraham Neyman, 2008.
"Learning Effectiveness and Memory Size,"
Levine's Working Paper Archive
122247000000001945, David K. Levine.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Discussion Paper Series dp476, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine.
- Ron Peretz, 2011. "Correlation through Bounded Recall Strategies," Discussion Paper Series dp579, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
- Ron Peretz, 2013. "Correlation through bounded recall strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 867-890, November.
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.- Hernández, Penélope & Solan, Eilon, 2016.
"Bounded computational capacity equilibrium,"
Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
- Eilon Solan & Penélope Hernández, 2014. "Bounded Computational Capacity Equilibrium," Discussion Papers in Economic Behaviour 0314, University of Valencia, ERI-CES.
- Hernández, Penélope & Urbano, Amparo, 2008.
"Codification schemes and finite automata,"
Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
- Amparo Urbano Salvador & Penélope Hernández Rojas, 2000. "Codification schemes and finite automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Bavly, Gilad & Neyman, Abraham, 2014.
"Online concealed correlation and bounded rationality,"
Games and Economic Behavior, Elsevier, vol. 88(C), pages 71-89.
- Gilad Bavly & Abraham Neyman, 2014. "Online Concealed Correlation and Bounded Rationality," Discussion Paper Series dp659, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008.
"Learning Effectiveness and Memory Size,"
Discussion Paper Series
dp476, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000001945, David K. Levine.
- Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
- Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
- Sylvain Béal, 2010.
"Perceptron versus automaton in the finitely repeated prisoner’s dilemma,"
Theory and Decision, Springer, vol. 69(2), pages 183-204, August.
- Sylvain Béal, 2010. "Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma," Post-Print halshs-00530593, HAL.
- 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.
- 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.
- Andrew Postlewaite & Olivier Compte, 2009. "Plausible Cooperation, Second Version," PIER Working Paper Archive 10-039, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 16 Dec 2010.
- O. Gossner, 2000. "Sharing a long secret in a few public words," THEMA Working Papers 2000-15, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- GOSSNER, Olivier, 1998.
"Repeated games played by cryptographically sophisticated players,"
LIDAM Discussion Papers CORE
1998035, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- O. Gossner, 1999. "Repeated games played by cryptographically sophisticated players," THEMA Working Papers 99-07, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Gossner, O., 1999. "Repeated Games played by Cryptographically Sophesticated Players," Papers 99-07, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- Daijiro Okada & Abraham Neyman, 2004. "Growing Strategy Sets in Repeated Games," Econometric Society 2004 North American Summer Meetings 625, Econometric Society.
- Neyman, Abraham & Okada, Daijiro, 2009.
"Growth of strategy sets, entropy, and nonstationary bounded recall,"
Games and Economic Behavior, Elsevier, vol. 66(1), pages 404-425, May.
- Abraham Neyman Null & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy and Nonstationary Bounded Recall," Departmental Working Papers 200514, Rutgers University, Department of Economics.
- Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Discussion Paper Series dp411, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Béal, Sylvain, 2007. "Perceptron Versus Automaton∗," Sonderforschungsbereich 504 Publications 07-58, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001.
"On the complexity of coordination,"
LIDAM Discussion Papers CORE
2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- O. Gossner & P. Hernandez, 2001. "On the complexity of coordination," THEMA Working Papers 2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Andriy Zapechelnyuk, 2008.
"Better-Reply Dynamics with Bounded Recall,"
Mathematics of Operations Research, INFORMS, vol. 33(4), pages 869-879, November.
- Andriy Zapechelnyuk, 2008. "Better-Reply Dynamics with Bounded Recall," Discussion Papers 2, Kyiv School of Economics, revised Mar 2008.
- Ron Peretz, 2011. "Correlation through Bounded Recall Strategies," Discussion Paper Series dp579, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Bavly, Gilad & Peretz, Ron, 2019. "Limits of correlation in repeated games with bounded memory," Games and Economic Behavior, Elsevier, vol. 115(C), pages 131-145.
- Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
- Compte, Olivier & Postlewaite, Andrew, 2015.
"Plausible cooperation,"
Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," Post-Print halshs-01204780, HAL.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
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:huj:dispap:dp435. 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: Michael Simkin (email available below). General contact details of provider: https://edirc.repec.org/data/crihuil.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.