IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0296731.html
   My bibliography  Save this article

The role of the working memory storage component in a random-like series generation

Author

Listed:
  • Mikołaj Biesaga
  • Andrzej Nowak

Abstract

People are not equipped with an internal random series generator. When asked to produce a random series they simply try to reproduce an output of known random process. However, this endeavor is very often limited by their working memory capacity. Here, we investigate the model of random-like series generation that accounts for the involvement of storage and processing components of working memory. In two studies, we used a modern, robust measure of randomness to assess human-generated series. In Study 1, in the experimental design with the visibility of the last generated elements as a between-subjects variable, we tested whether decreasing cognitive load on working memory would mitigate the decay in the level of randomness of the generated series. Moreover, we investigated the relationship between randomness judgment and algorithmic complexity of human-generated series. Results showed that when people did not have to solely rely on their working memory storage component to maintain active past choices they were able to prolongate their high-quality performance. Moreover, people who were able to better distinguish more complex patterns at the same time generated more random series. In Study 2, in the correlational design, we examined the relationship between working memory capacity and the ability to produce random-like series. Results revealed that individuals with longer working memory capacity also were to produce more complex series. These findings highlight the importance of working memory in generating random-like series and provide insights into the underlying mechanisms of this cognitive process.

Suggested Citation

  • Mikołaj Biesaga & Andrzej Nowak, 2024. "The role of the working memory storage component in a random-like series generation," PLOS ONE, Public Library of Science, vol. 19(1), pages 1-22, January.
  • Handle: RePEc:plo:pone00:0296731
    DOI: 10.1371/journal.pone.0296731
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0296731
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0296731&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0296731?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. Siegfried Berninghaus & Hans Haller & Alexander Outkin, 2006. "Neural networks and contagion," Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 11-11.
    3. 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.
    4. van Damme, E.E.C., 1995. "Game theory : The next stage," Discussion Paper 1995-73, Tilburg University, Center for Economic Research.
    5. 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.
    6. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    7. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    8. 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.
    9. 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.
    10. 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.
    11. Kagel, John & McGee, Peter, 2014. "Personality and cooperation in finitely repeated prisoner’s dilemma games," Economics Letters, Elsevier, vol. 124(2), pages 274-277.
    12. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    13. Tovey, Craig A., 2010. "The instability of instability of centered distributions," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 53-73, January.
    14. 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.
    15. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    16. 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.
    17. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    18. 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.
    19. 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).
    20. Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Levine's Bibliography 122247000000000920, UCLA Department of Economics.

    More about this item

    Statistics

    Access and download statistics

    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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.