Coordination problems on networks revisited: statics and dynamics

  title={Coordination problems on networks revisited: statics and dynamics},
  author={Luca Dall’Asta},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  • L. Dall’Asta
  • Published 4 June 2021
  • Economics
  • Journal of Statistical Mechanics: Theory and Experiment
Simple binary-state coordination models are widely used to study collective socio-economic phenomena such as the spread of innovations or the adoption of products on social networks. The common trait of these systems is the occurrence of large-scale coordination events taking place abruptly, in the form of a cascade process, as a consequence of small perturbations of an apparently stable state. The conditions for the occurrence of cascade instabilities have been largely analysed in the… 
1 Citations

Dynamics of Diffusion on Monoplex and Multiplex Networks: A Message-Passing Approach

It is verified that the dynamics of diffusion observed on synthetic networks are accurately replicated by the message-passing equation, whose fixed point corresponds to a Nash equilibrium, while the conventional mean-field method tends to overestimate the size and frequency of diffusion.



Topological Traps Control Flow on Real Networks: The Case of Coordination Failures

It is concluded that model networks must be improved to include these mesoscopic structures, in particular from topological traps formed by links between nodes of different degrees in regions with few or no redundant paths, in order to successfully address issues such as the emergence of cooperation in real societies.

A simple model of global cascades on random networks

  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but anincreasingly heterogeneous degree distribution makes it less vulnerable.

The spread of innovations in social networks

This paper characterizes the rate of convergence as a function of the structure of the interaction network and considers scenarios where the individuals’ behavior is the result of a strategic choice among competing alternatives based on the dynamics of coordination games.

Diffusion and cascading behavior in random networks

A model of diffusion where the individualsʼ behavior is the result of a strategic choice is considered and it is shown that connectivity plays an ambiguous role: while it allows the diffusion to spread, when the network is highly connected, the diffusion is also limited by high-degree nodes which are very stable.

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

This work considers a heterogeneous, agent-based model in which agents interact strategically with their neighbors but their preferences and payoffs for the possible actions differ, and studies the emergence of the equilibria predicted analytically in random graphs under best response dynamics.

Experimental Games on Networks: Underpinnings of Behavior and Equilibrium Selection

In this paper, we describe a series of laboratory experiments that implement specific examples of a general network structure. Specifically, actions are either strategic substitutes or strategic

Statics and Dynamics of Selfish Interactions in Distributed Service Systems

A technique is proposed, based on the cavity method of statistical physics, to characterize the full spectrum of Nash equilibria of the game, which models the competition among agents to access some service provided by distributed service units and which exhibits congestion and frustration phenomena when service units have limited capacity.

Binary-state dynamics on complex networks: pair approximation and beyond

A wide class of binary-state dynamics on networks---including, for example, the voter model, the Bass diffusion model, and threshold models---can be described in terms of transition rates (spin-flip

Coordination on Networks: Does Topology Matter?

It is found that human players dynamics do not converge to the efficient outcome more often in the cliquish network than in the random network, and numerical simulations agree with laboratory results once they implement the actual individual updating rule that human subjects use in the authors' laboratory experiments.

Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues

A collection of probabilistic and game-theoretic models for such phenomena proposed in the mathematical social sciences, as well as recent algorithmic work on the problem by computer scientists are considered.