The role of the working memory storage component in a random-like series generation
Author
Abstract
Suggested Citation
DOI: 10.1371/journal.pone.0296731
Download full text from publisher
References listed on IDEAS
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Froelich, Amy G. & Duckworth, William M. & Culhane, Jessica, 2009. "Does Your iPod Really Play Favorites?," The American Statistician, American Statistical Association, vol. 63(3), pages 263-268.
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.- 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.
- Siegfried Berninghaus & Hans Haller & Alexander Outkin, 2006.
"Neural networks and contagion,"
Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 11-11.
- Berninghaus, Siegfried & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Papers 05-35, Sonderforschungsbreich 504.
- Berninghaus, Siegfried K. & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Sonderforschungsbereich 504 Publications 05-35, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Joshua M. Epstein, 2007. "Agent-Based Computational Models and Generative Social Science," Introductory Chapters, in: Generative Social Science Studies in Agent-Based Computational Modeling, Princeton University Press.
- van Damme, E.E.C., 1995.
"Game theory : The next stage,"
Discussion Paper
1995-73, Tilburg University, Center for Economic Research.
- van Damme, E.E.C., 1999. "Game theory : The next stage," Other publications TiSEM 9b1f2bbf-2e19-42e7-894a-4, Tilburg University, School of Economics and Management.
- van Damme, E.E.C., 1995. "Game theory : The next stage," Other publications TiSEM 7779b0f9-bef5-45c7-ae6b-7, Tilburg University, School of Economics and Management.
- 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.
- Jehiel, Philippe, 2005.
"Analogy-based expectation equilibrium,"
Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
- Philippe Jeniel, 2001. "Analogy-Based Expectation Equilibrium," Economics Working Papers 0003, Institute for Advanced Study, School of Social Science.
- Philippe Jehiel, 2005. "Analogy-Based Expectation Equilibrium," Levine's Bibliography 784828000000000106, UCLA Department of Economics.
- Philippe Jehiel, 2005. "Analogy-based Expectation Equilibrium," Post-Print halshs-00754070, HAL.
- Beal, Sylvain & Querou, Nicolas, 2007.
"Bounded rationality and repeated network formation,"
Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
- Beal, Sylvain & Querou, Nicolas, 2006. "Bounded Rationality and Repeated Network Formation," Coalition Theory Network Working Papers 12169, Fondazione Eni Enrico Mattei (FEEM).
- Sylvain Béal & Nicolas Quérou, 2007. "Bounded rationality and repeated network formation," Post-Print ujm-00162449, HAL.
- Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
- David Hugh-Jones & Ro’i Zultan, 2013.
"Reputation and Cooperation in Defense,"
Journal of Conflict Resolution, Peace Science Society (International), vol. 57(2), pages 327-355, April.
- Hugh Jones, David & Zultan, Ro'i, 2011. "Reputation and Cooperation in Defence," CAGE Online Working Paper Series 53, Competitive Advantage in the Global Economy (CAGE).
- 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.
- Hitoshi Matsushima, 2012.
"Finitely Repeated Prisoners' Dilemma With Small Fines: The Penance Contract,"
The Japanese Economic Review, Japanese Economic Association, vol. 63(3), pages 333-347, September.
- Hitoshi Matsushima, 2010. "Finitely Repeated Prisoners' Dilemma with Small Fines: Penance Contract," CIRJE F-Series CIRJE-F-720, CIRJE, Faculty of Economics, University of Tokyo.
- Hitoshi Matsushima, 2010. "Finitely Repeated Prisoners' Dilemma with Small Fines: Penance Contract," CARF F-Series CARF-F-208, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
- Kagel, John & McGee, Peter, 2014. "Personality and cooperation in finitely repeated prisoner’s dilemma games," Economics Letters, Elsevier, vol. 124(2), pages 274-277.
- Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
- Tovey, Craig A., 2010. "The instability of instability of centered distributions," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 53-73, January.
- Mount, Kenneth R & Reiter, Stanley, 1996.
"A Lower Bound on Computational Complexity Given by Revelation Mechanisms,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266, February.
- Kenneth R. Mount & Stanley Reiter, 1996. "A lower bound on computational complexity given by revelation mechanisms (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266.
- Kenneth R. Mount & Stanley Reiter, 1994. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Discussion Papers 1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- Eli Ben-Sasson & Adam Tauman Kalai & Ehud Kalai, 2006. "An Approach to Bounded Rationality," Discussion Papers 1439, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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).
- Yuval Salant, 2011. "Procedural Analysis of Choice Rules with Applications to Bounded Rationality," American Economic Review, American Economic Association, vol. 101(2), pages 724-748, April.
- Amparo Urbano & Penélope Hernández, 2001. "Communication And Automata," Working Papers. Serie AD 2001-04, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Levine's Bibliography 122247000000000920, UCLA Department of Economics.
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:plo:pone00:0296731. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.