Games (Aug 2010)

Local Interaction on Random Graphs

  • Hans Haller,
  • Siegfried Berninghaus

DOI
https://doi.org/10.3390/g1030262
Journal volume & issue
Vol. 1, no. 3
pp. 262 – 285

Abstract

Read online

We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic graph or the realization of a random graph) cannot change over time.

Keywords