David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Synthese 168 (2):273 - 294 (2009)
Axelrod (The evolution of cooperation, 1984) and others explain how cooperation can emerge in repeated 2-person prisoner’s dilemmas. But in public good games with anonymous contributions, we expect a breakdown of cooperation because direct reciprocity fails. However, if agents are situated in a social network determining which agents interact, and if they can influence the network, then cooperation can be a viable strategy. Social networks are modelled as graphs. Agents play public good games with their neighbours. After each game, they can terminate connections to others, and new connections are created. Cooperative agents do well because they manage to cluster with cooperators and avoid defectors. Computer simulations demonstrate that group formation and exclusion are powerful mechanisms to promote cooperation in dilemma situations. This explains why social dilemmas can often be solved if agents can choose with whom they interact.
|Keywords||Cooperation Dynamic network Graph Scale-free network Exclusion Public good Group formation|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Subhadip Chakrabarti, Robert P. Gilles & Emiliya A. Lazarova (2011). Strategic Behavior Under Partial Cooperation. Theory and Decision 71 (2):175-193.
Mathias Spichtig & Christian Traxler, Social Norms and the Indirect Evolution of Conditional Cooperation.
Ilan Fischer (2003). The Emergence of Reactive Strategies in Simulated Heterogeneous Populations. Theory and Decision 55 (4):289-314.
Robert Hoffmann (1999). The Independent Localisations of Interaction and Learning in the Repeated Prisoner's Dilemma. Theory and Decision 47 (1):57-72.
Michael Moehler (2009). Justice and Peaceful Cooperation. Journal of Global Ethics 5 (3):195-214.
Magnus Jiborn & Wlodek Rabinowicz (2003). Reconsidering the Foole's Rejoinder: Backward Induction in Indefinitely Iterated Prisoner's Dilemmas. Synthese 136 (2):135 - 157.
Cristina Bicchieri & Azi Lev-On (2007). Computer-Mediated Communication and Cooperation in Social Dilemmas: An Experimental Analysis. Politics, Philosophy and Economics 6 (2):139-168.
Kai Spiekermann (2008). Reply: Clubbish Justice. Politics, Philosophy and Economics 7 (4):447-453.
Kai Spiekermann (2007). Translucency, Assortation, and Information Pooling: How Groups Solve Social Dilemmas. Politics, Philosophy and Economics 6 (3):285-306.
Added to index2009-01-28
Total downloads4 ( #195,487 of 1,004,909 )
Recent downloads (6 months)0
How can I increase my downloads?