Coordination games on dynamical networks

From MaRDI portal
Publication:2344939





Summary: 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.




Cited in
(32)








This page was built for publication: Coordination games on dynamical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344939)