Local interaction on random graphs

DOI10.3390/G1030262MaRDI QIDQ2344940zbMATH OpenOpenAlexFDO

Authors Siegfried K. Berninghaus, Hans Haller

Publication date 19 May 2015

Published in Games (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/g1030262

zbMATH Keywords

contagioncoordination gameslocal interaction gamesrandom graphs

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Social networks; opinion dynamics (91D30)

Review text

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

Recommendations

• Dynamics in Network Interaction Games
• Dynamics in network interaction games
• Potential games in volatile environments
• Game theoretical modelling of a dynamically evolving network. II: Target sequences of score 1
• Evolutionary games and local dynamics

Cites work

• A Noncooperative Model of Network Formation
• A strategic model of social and economic networks
• Adaptive play with spatial sampling.
• Connections. An introduction to the economics of networks.
• Contagion
• Contagion and coordination in random networks
• Contagion and efficiency
• Control costs and potential functions for spatial games
• Dynamic monopolies in tori.
• Efficient equilibrium selection in evolutionary games with random matching
• Endogenous networks, social games, and evolution
• Evolution with State-Dependent Mutations
• Evolutionary games and computer simulations.
• Existence of independent random matching
• Imitation, local interactions, and efficiency
• Learning, Local Interaction, and Coordination
• Local majorities, coalitions and monopolies in graphs: A review
• Network formation and social coordination
• Noisy Contagion Without Mutation
• Non-exclusive conventions and social coordination
• On the formation of interaction networks in social coordination games.
• Optimal irreversible dynamos in chordal rings
• Path dependence and learning from neighbors
• Periodic behaviour of generalized threshold functions
• Size bounds for dynamic monopolies
• THE SPATIAL DILEMMAS OF EVOLUTION
• The statistical mechanics of best-response strategy revision
• The statistical mechanics of strategic interaction

Cited in

(8)

• Local interactions and \(p\)-best response set
• Coordination games and local interactions: a survey of the game theoretic literature
• Pairwise-interaction games
• Dynamics in Network Interaction Games
• Locality of Global Stochastic Interaction in Directed Acyclic Networks
• Local weak convergence for sparse networks of interacting processes
• Local dependency in networks
• Contagion and uninvadability in local interaction games: the bilingual game and general supermodular games

This page was built for publication: Local interaction on random graphs

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