Abstract
A Prisoner&2018;s dilemma that is repeated indefinitely has many equilibria; the problem of selecting among these is often approached using evolutionary models. The background of this paper is a number of earlier studies in which a specific type of evolutionary model, a genetic algorithm (GA), was used to investigate which behavior survives under selective pressure. However, that normative instrument searches for equilibria that may never be attainable. Furthermore, it aims for optimization and, accordingly, says what people should do to be successful in repeated prisoner&2018;s dilemma (RPD) type situations. In the current paper, I employ simulation to find out what people would do, whether this makes them successful or not. Using a replication of Miller&2018;s (1988) GA study for comparison, a model is simulated in which the population is spatially distributed across a torus. The agents only interact with their neighbors and locally adapt their strategy to what they perceive to be successful behavior among those neighbors. Although centralized GA-evolution may lead to somewhat better performance, this goes at the cost of a large increase in required computations while a population with decentralized interactions and co-adaptation is almost as successful and, additionally, endogenously learns a more efficient scheme for adaptation. Finally, when the agents&2018; perceptive capabilities are limited even further, so that they can only perceive how their neighbors are doing against themselves, rather than against all those neighbors&2018; opponents&2014;which essentially removes reputation as a source of information&2014;cooperation breaks down.
Similar content being viewed by others
References
Axelrod, R. (1984), The evolution of Cooperation. New York: Basic Books.
Axelrod, R. (1987), "The Evolution of Strategies in the Iterated Prisoner's Dilemma," in L. Davis (Ed.) Genetic Algorithms and Simulated Annealing, London: Pitman, pp. 32–41.
Binmore, K.G. and L. Samuelson (1992), "Evolutionary Stability in Repeated Games Played by Finite Automata," Journal of Economic Theory, 57(2), 278–305.
Binmore, K.G. and L. Samuelson (1994), "Drift," European Economic Review, 38(3/4), 859–867.
Birtwistle, G.M., O.-J. Dahl, B. Myhrhaug and K. Nygaard (1973), SIMULA Begin, Studentlitteratur, Lund, Sweden.
Carley, K.M. and D.M. Svoboda (1996), "Modeling Organizational Adaptation as a Simulated Annealing Process," Sociological Methods & Research, 25(1), 138–168.
Chattoe, E. (1998), "Just How (Un)realistic are Evolutionary Algorithms as Representations of Social Processes?," Journal of Artificial Societies and Social Simulation, //www.soc.surrey.ac.uk/JASSS/1/3/2.html.
Darwen, P.J. and X. Yao (1995), "On Evolving Robust Strategies for Iterated Prisoner's Dilemma," in X. Yao (Ed.) Progress in Evolutionary Computation, number 965 in Lecture Notes in Artificial Intelligence, Berlin: Springer, pp. 276–292.
Davis, L. (1991), Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
Dawid, H. (1996), Adaptive Learning by Genetic Algorithms: Analytical Results and Applications to Economic Models. Berlin: Springer-Verlag.
Deutsch, M. (1973), The Resolution of Conflict: Constructive and Destructive Processes. New Haven: University Press.
Epstein, J.M. and R.L. Axtell (1996), Growing Artificial Societies: Social Science from the Bottom Up. Washington, DC/Cambridge, MA: Brookings Institution Press/The MIT Press.
Flache, A. (1996), The Double Edge of Networks: An Analysis of the Effect of Informal Networks on Cooperation in Social Dilemmas,Ph.D. thesis, University of Groningen, Groningen.
Gale, D. and L.S. Shapley (1962), "College Admissions and the Stability of Marriage," American Mathematical Monthly, 69(1), 9–15.
Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley.
Hill, C.W. (1990), "Cooperation, Opportunism, and the Invisible Hand: Implications for Transaction Cost Theory," Academy of Management Review, 15(3), 500–513.
Ho, T.-H. (1996), "Finite Automata Play Repeated Prisoner's Dilemma's with Information Processing Costs," Journal of Economic Dynamics and Control, 20(1–3), 173–207.
Hoffmann, J.R. and N. Waring (1996), "The Localisation of Interaction and Learning in the Repeated Prisoner's Dilemma," Working Paper 96–08–064, Santa Fe Institute. http://www.ccc.nottingham.ac.uk/~lizrh2/sfi.ps.
Holland, J.H. (1992a), Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence (2nd edition). Cambridge, MA: The MIT Press.
Holland, J.H. (1992b), "Complex Adaptive Systems," Daedalus, 121(1), 17–30.
Holland, J.H. and J.H. Miller (1991), "Artificial Adaptive Agents in Economic Theory," American Economic Review, 81(2), 365–370.
Kirchkamp, O. (1995), "Spatial Evolution of Automata in the Repeated Prisoner's Dilemma," SFB 303 Discussion Paper B-330, University of Bonn. http://www.sfb504.uni-mannheim.de/~oliver/NetAbst.pdf.
Linster, B.G. (1992), "Evolutionary Stability in the Infinitely Repeated Prisoner's Dilemma Played by Two-State Moore Machines," Southern Economic Journal, 58(4), 880–903.
Lomborg, B. (1996), "Nucleus and Shield: The Evolution of Social Structure in the Iterated Prisoner's Dilemma," American Sociological Review, 61(2), 278–307.
Macy, M.W. (1996), "Natural Selection and Social Learning in prisoner's Dilemma: Co-adaptation with Genetic Algorithms and Artificial Neural Networks," in W.B. Liebrand and D.M. Messick (Eds.) Frontiers in Social Dilemmas Research, Berlin: Springer, pp. 235–265.
Marks, R.E. (1992), "Breeding Hybrid Strategies: Optimal Behavior for Oligopolists," Journal of Evolutionary Economics, 2(1), 17–38.
McFadzean, D. and L.S. Tesfatsion (1996), "A C++ Platform for the Evolution of Trade Networks," Economic Report 39, Iowa State University. http://www.econ.iastate.edu/tesfatsi/platroot.ps.
Miller, J.H. (1988), "The Evolution of Automata in the Repeated Prisoner's Dilemma," Two Essays on the Economics of Imperfect Information, Ph.D. thesis, University of Michigan, ftp://zia.hss.cmu.edu/ pub/miller/ceoa.ps (many figures omitted).
Miller, J.H. (1995), "Evolving Information Processing Organizations," Working paper, Carnegie Mellon University. ftp://zia.hss.cmu.edu/pub/miller/evolorg.ps.
Miller, J.H. (1996), "The Co-evolution of Automata in the Repeated Prisoner's Dilemma," Journal of Economic Behavior and Organization, 29(1), 87–112.
Minar, N., R. Burkhart, C.G. Langton and M. Askenazi (1996), "The Swarn Simulation System: A Toolkit for Building Multi-Agent Simulation," Technical report, Santa Fe Institute, Santa Fe, NM. http://www.santafe.edu/projects/swarm/overview.ps.
Nowak, M.A. and R.M. May (1992), "Evolutionary Games and Spatial Chaos," Nature, 359, 826–829.
Oliphant, M. (1994), "Evolving Cooperation in the Non-Iterated Prisoner's Dilemma: The Importance of Spatial Organization," in R. Brooks and P. Maes (Eds.) Proceedings of the Fourth Artificial Life Workshop, The MIT Press, Cambridge, MA, pp. 349–352.
Parkhe, A. (1993), "Strategic Alliance Structuring: A Game Theoretic and Transaction Cost Examination of Interfirm Cooperation," Academy of Management Journal, 36(4), 794–829.
Price, T.C. (1997), "Using Co-evolutionary Programming to Simulate Strategic Behavior in Markets," Journal of Evolutionary Economics, 7(3), 219–254.
Routledge, B. (1993), "Co-evolution and Spatial Interaction," Working paper, University of British, Columbia.
Rubinstein, A. (1986), "Finite Automata Play the Repeated Prisoner's Dilemma," Journal of Economic Theory, 39(1), 83–96.
Schelling, T.C. (1971), "Dynamic Models of Segregation," Journal of Mathematical Sociology, 1(2), 143–186.
Smucker, M.D., E.A. Stanley and D. Ashlock (1994), "Analyzing Social Network Structures in the Iterated Prisoner's Dilemma with Choice and Refusal," Technical Report CS-TR–94–1259, University of Wisconsin-Madison, Department of Computer Sciences. http://econwpa.wustl.edu:8089/eps/game/papers/9501/9501001.ps.gz.
Stanley, E.A., D. Ashlock and L.S. Tesfatsion (1994), "Iterated Prisoner's Dilemma with Choice and Refusal of Partners," in C.G. Langton (Ed.) Artificial Life III, Vol. XVII of SFI Studies in the Sciences of Complexity, Reading, MA: Addison-Wesley, pp. 131–175.
Stark, O. (1985), "On private Charity and Altruism," Public Choice, 46, 325–332.
Tesfatsion, L.S. (1997), "ATrade Network Game with Endogenous Partner Selection," in H.M. Amman, B. Rustem and A.B. Whinston (Eds.) Computational Approaches to Economic Problems, Vol. 6 of Advances in Computational Economics, Dordrecht: Kluwer, pp. 249–269.
Tesfatsion, L.S. (1998), "Exante Capacity Effects in Evolutionary Labor Markets with Adaptive Search," Economic Report 48, Iowa State University. http://www.econ.iastate.edu/tesfatsi/evlab.ps.
Vriend, N.J. (1998), "An Illustration of the Essential Difference Between Individual and Social Learning, and its Consequences for Computational Analyses,”Working Paper 387, Queen Mary and Westfield College, University of London, London. http://www.econ.qmw.ac.uk/papers/wp387.pdf.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klos, T.B. Decentralized Interaction and Co-Adaptation in the Repeated Prisoner&2018;s Dilemma. Computational & Mathematical Organization Theory 5, 147–165 (1999). https://doi.org/10.1023/A:1009679005701
Issue Date:
DOI: https://doi.org/10.1023/A:1009679005701