IDEAS home Printed from https://ideas.repec.org/a/vrs/subboe/v70y2025i1p67-82n1004.html
   My bibliography  Save this article

The Second Axelrod Tournament: A Monte Carlo Exploration of Uncertainty About the Number of Rounds in Iterated Prisoner’s Dilemma

Author

Listed:
  • Pop Gabriel

    (Babeș-Bolyai University, Romania)

  • Milencianu Mircea

    (Babeș-Bolyai University, Romania)

  • Pop Alexandra

    (Babeș-Bolyai University, Romania)

Abstract

Strategic decision-making in multi-agent interactions inside the Iterated Prisoner’s Dilemma (IPD) is investigated in this work using Monte Carlo simulations. Building on Axelrod’s work, we present a second-generation tournament with stochastic components, including unpredictable game lengths, to evaluate strategy adaptability and resilience. We analyze how uncertainty influences strategic performance by using a comparison between instances with fixed and uncertain times. We identify, using a descriptive approach, methods demonstrating important behavioral differences between deterministic and uncertain settings. The results provide understanding of adaptive learning, response dynamics, and strategic flexibility, so helping to build strong collaborative strategies for artificial intelligence and decision-making systems. Our results highlight the limitations of exclusively deterministic methods and suggest the necessity for adaptive approaches to improve long-term cooperative success.

Suggested Citation

  • Pop Gabriel & Milencianu Mircea & Pop Alexandra, 2025. "The Second Axelrod Tournament: A Monte Carlo Exploration of Uncertainty About the Number of Rounds in Iterated Prisoner’s Dilemma," Studia Universitatis Babeș-Bolyai Oeconomica, Sciendo, vol. 70(1), pages 67-82.
    • Handle: RePEc:vrs:subboe:v:70:y:2025:i:1:p:67-82:n:1004
    DOI: 10.2478/subboec-2025-0004
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/subboec-2025-0004
    Download Restriction: no
    File URL: https://libkey.io/10.2478/subboec-2025-0004?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. Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
    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. Daniel John Zizzo & Daniel Sgroi, 2001. "Bounded-Rational Behavior by Neural Networks in Normal Form Games," Economics Series Working Papers 2000-W30, University of Oxford, Department of Economics.
    2. 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.
    3. 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.
    4. 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.
    5. Dargaj, Jakub & Simonsen, Jakob Grue, 2023. "A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff," Journal of Economic Theory, Elsevier, vol. 213(C).
    6. João E. Gata, 2019. "Controlling Algorithmic Collusion: short review of the literature, undecidability, and alternative approaches," Working Papers REM 2019/77, ISEG - Lisbon School of Economics and Management, REM, Universidade de Lisboa.
    7. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    8. 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.
    9. repec:dau:papers:123456789/6127 is not listed on IDEAS
    10. 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.
    11. Ehud Lehrer & Eilon Solan, 2003. "No-Regret with Bounded Computational Capacity," Discussion Papers 1373, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    13. Stephan Schosser & Bodo Vogt, 2015. "What automaton model captures decision making? A call for finding a behavioral taxonomy of complexity," FEMM Working Papers 150010, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    14. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    15. Oliveira, Fernando S., 2010. "Limitations of learning in automata-based systems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 684-691, June.
    16. Compte, Olivier & Postlewaite, Andrew, 2015. "Plausible cooperation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
    17. Jakub Dargaj & Jakob Grue Simonsen, 2020. "A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff," Papers 2005.13921, arXiv.org, revised Jun 2020.
    18. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    19. Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
    20. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    21. Sgroi, Daniel & Zizzo, Daniel John, 2009. "Learning to play 3×3 games: Neural networks as bounded-rational players," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 27-38, January.

    More about this item

    Keywords

    Prisoner’s Dilemma; repeated games; Axelrod second Tournament; agent-based modeling; finite and infinite games;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other

    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:vrs:subboe:v:70:y:2025:i:1:p:67-82:n:1004. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    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.