Coordination games on graphs

DOI10.1007/s00182-016-0560-8zbMath1415.91063arXiv1501.07388OpenAlexW1523060149MaRDI QIDQ1677255

Mona Rahn, Guido Schäfer, Bart de Keijzer, Sunil Simon, Krzysztof R. Apt

Publication date: 10 November 2017

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.07388

zbMATH Keywords

Nash equilibriagraphscoordination gamesprice of anarchyprice of stabilitystrong equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Coordination Games on Weighted Directed Graphs, The optimal way to play the most difficult repeated two-player coordination games, Unnamed Item, Price of anarchy for graph coloring games with concave payoff, Topological price of anarchy bounds for clustering games on networks, Dynamic matching pennies on networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• Graphical congestion games
• The stability of hedonic coalition structures
• Strong price of anarchy
• Strong equilibrium in congestion games
• Pure strategy Nash equilibrium in a group formation game with positive externalities
• Congestion games with player-specific payoff functions
• Strong equilibria in games with the lexicographical improvement property
• Core in a simple coalition formation game
• A class of games possessing pure-strategy Nash equilibria
• Coordination Games on Graphs (Extended Abstract)
• Efficient Equilibria in Polymatrix Coordination Games
• Diffusion in Social Networks with Competing Products
• Computing Stable Outcomes in Hedonic Games
• A Unified Framework for Strong Price of Anarchy in Clustering Games
• The Max k-Cut Game and Its Strong Equilibria
• A Game Theoretic Approach for Efficient Graph Coloring
• Strategic Coloring of a Graph
• Social network games
• Equilibria of Polymatrix Games