Please use this identifier to cite or link to this item:
Tomassini, Marco
Pestelacci, Enea
Year of Publication: 
[Journal:] Games [ISSN:] 2073-4336 [Publisher:] MDPI [Place:] Basel [Volume:] 1 [Year:] 2010 [Issue:] 3 [Pages:] 242-261
We propose a model in which agents of a population interacting according to a network of contacts play games of coordination with each other and can also dynamically break and redirect links to neighbors if they are unsatisfied. As a result, there is co-evolution of strategies in the population and of the graph that represents the network of contacts. We apply the model to the class of pure and general coordination games. For pure coordination games, the networks co-evolve towards the polarization of different strategies. In the case of general coordination games our results show that the possibility of refusing neighbors and choosing different partners increases the success rate of the Pareto-dominant equilibrium.
evolutionary game theory
coordination games
games on dynamical networks
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 
Appears in Collections:

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.