Local Interaction on Random Graphs†
AbstractWe 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Berninghaus, S.; Haller, H. Local Interaction on Random Graphs. Games 2010, 1, 262-285.
Berninghaus S, Haller H. Local Interaction on Random Graphs. Games. 2010; 1(3):262-285.Chicago/Turabian Style
Berninghaus, Siegfried; Haller, Hans. 2010. "Local Interaction on Random Graphs." Games 1, no. 3: 262-285.