Academia.eduAcademia.edu

Outline

Draft Complex Behaviour in Challenging Social Situations

Abstract

Social situations can be modeled as games with payoff struc- tures. The complexity of the situation emerges from the pattern of pay- offs. Inferring the outcome of the game from the payoff matrix is the conventional approach to describing, predicting or prescribing behaviour of participants. This approach makes a strong assumption of rationality of the players and suffers from other drawbacks as well. While Nash (8) proved a mixed equilibrium always exists, this appealing universality comes at a price. Mixed equilibria are not a natural and credible model of decision-making behaviour. Indeed, it has been shown that efficient algorithms to compute mixed equilibria likely do not exist for all games. (3) The pure Nash equilibrium, a more appealing model of behaviour, fails on universality: a subset of games - and a growing proportion as the number of players and choices increases - do not possess a pure Nash equilibrium. Miller (5),(6) describes unpublished research in which he took a ...

References (15)

  1. Axelrod, Robert. "Effective Choice in the Prisoner's Dilemma" in Journal of Con- flict Resolution, Vol. 24, No. 1: 3-25. 1980.
  2. Axelrod, Robert. "More Effective Choice in the Prisoner's Dilemma" in Journal of Conflict Resolution, Vol. 24, No. 3: 379-403. 1980.
  3. Daskalakis, Constantinos, P.W. Goldberg, and C.H. Papadimitriou. "The Complex- ity of Computing a Nash Equilibrium." Communications of the ACM, vol 52(2). 2009.
  4. Kalai, Ehud and Meir Smorodinski. "Other Solutions to Nash's Bargaining Prob- lem" in Econometrica, Vol. 43: 513-518. 1975.
  5. Miller, John. A Strategic Taxonomy of Repeated 2 × 2 Games Played by Adaptive Agents Draft document. Carnegie Mellon and Santa Fe Institute. 1991.
  6. Miller, John. Complex Adaptive Systems. Princeton NJ. Princeton University Press. 2007.
  7. Nash, John. "The Bargaining Problem". Econometrica 18(2): 155162. 1950.
  8. Nash, John. "Noncooperative Games" Ann. Math. 54. 1951.
  9. Robinson, David and David Goforth. The Topology of The 2 × 2 games : A New Periodic Table. London UK. Routledge. 2005.
  10. 44/33/22/11 . a .ND P.R P.C P.. 99.6 0.2 0.2 0.0 -0.5 0.4 -0.1 -0.50 -0.55 2 44/33/12/21 . a .ND P.R P.C P.. 99.5 0.2 0.2 0.0 -0.4 0.1 -0.3 -0.58 -0.63
  11. 44/32/23/11 S a .ND P.R P.C P.. 99.5 0.2 0.2 0.0 -1.0 -0.7 -1.6 -0.59 -0.63
  12. 44/32/13/21 . a .ND P.R P.C P.. 99.5 0.3 0.1 0.0 -0.3 -0.8 -1.1 -0.50 -0.54 5 44/31/13/22 S a .ND P.R P.C P.. 99.6 0.2 0.2 0.0 -0.8 0.5 -1.4 -0.58 -0.63 . . . 12 22/41/14/33 S c PND ..R ..C ...
  13. N. P.. P.. PN. 99.3 0.3 0.3 0.1 0.7 -0.2 0.5 -0.58 -0.62 63 44/12/21/33 S k .N. P.. P.. PN. 94.3 0.2 0.3 5.2 1.1 0.5 1.6 -0.50 -0.54 . . . 78 22/31/43/14 . n P.. P.. ... .
  14. G# Payoffs S RG 0,0 0,1 1,0 1,1 0,0 0,1 1,0 1,1 rcpx ccpx scpx maxTD aggTD Column Legend G# RG number Payoffs payoff matrix S (S) symmetric or (.) not RG Rapoport and Guyer classification (e.g., a: two dominant strategies, no conflict)
  15. 0 0,1 1,0 1,1 (P or .) Pareto-dominated; (N or .) pure Nash equilibrium; (D,R,C,.) both, row, col or no dominant strategy 0,0 0,1 1,0 1,1 frequencies of observed outcomes rcpx, ccpx, scpx normalized complexity for row, column and aggregate maxTD, aggTD normalized maximum outcome frequency temporal deviation, aggregate deviation for all outcomes TABLE 3. example of Miller's Data