Download presentation

Presentation is loading. Please wait.

Published byMalachi Yelvington Modified about 1 year ago

1
How Cooperation Arises in Evolving Social Networks An Agent-Based Model by Ariana Strandburg-Peshkin An Agent-Based Model by Ariana Strandburg-Peshkin

2
The Prisoner’s Dilemma

3
Networks

4
Evolving Networks Network Structure Network Dynamics

5
The Model 2, 20, 3 3, 01, 1 A strategy - probability of cooperating (0 - 1) Links to other agents (“neighbors”) Agents in a network play prisoners’ dilemma with all their “neighbors” Agent 1 Payoffs CD Agent 2 Payoffs D C Each agent has…

6
An Agent’s Universe Strategy Payoff Strategy Payoff Weight Strategy Payoff Strategy Payoff

7
Each Iteration… Play all neighbors, sum up total payoff, and update link weights Find most successful neighbor Move toward most successful strategy Break ties with worst enemy Replenish ties broken

8
Results Break ties --> Cooperate No breaking ties --> Defect

9
Why? Strategy Links

10
Speed of Convergence Parameters Explored: Probability of Breaking Ties Network Size (# agents) Network Density (# links) Parameters Explored: Probability of Breaking Ties Network Size (# agents) Network Density (# links)

11

12

13

14

15

16
Results - Summary Networks with any probability of breaking ties eventually converge on cooperation The speed of convergence depends on: Probability of breaking ties (> = faster) Size of network (> = slower) # of Links (> = slower) Networks with any probability of breaking ties eventually converge on cooperation The speed of convergence depends on: Probability of breaking ties (> = faster) Size of network (> = slower) # of Links (> = slower)

17
Implications / Limitations Social “punishment” (by breaking ties) is effective in promoting cooperation Model requires that agents be intelligent and knowledgeable about one another Keep track of neighbors / weights Know neighbors’ strategies and payoffs No complex strategies (e.g. Tit-For-Tat) Social “punishment” (by breaking ties) is effective in promoting cooperation Model requires that agents be intelligent and knowledgeable about one another Keep track of neighbors / weights Know neighbors’ strategies and payoffs No complex strategies (e.g. Tit-For-Tat)

18
Other Cool Things To Look At Different Payoff Schemes More complex strategies Network Structure How is it affected by the game played? Cost of keeping so many ties? Cost of making and breaking ties? Robustness Different Payoff Schemes More complex strategies Network Structure How is it affected by the game played? Cost of keeping so many ties? Cost of making and breaking ties? Robustness

19
Sources Abramson, Guillermo, and Marcelo Kuperman. "Social games in a social network." Physical Review E 63.3 (2001). 10 Apr. 2008. Calderon, Juan. "Games on Evolving Networks." Complex Systems Summer School at Santa Fe Institute. 18 Mar. 2008 © 2017 SlidePlayer.com Inc.

All rights reserved.
Ads by Google