Coordination games on graphs (extended abstract)
From MaRDI portal
Publication:2937007
DOI10.1007/978-3-319-13129-0_37zbMATH Open1404.91040OpenAlexW2587056309MaRDI QIDQ2937007FDOQ2937007
Authors: Krzysztof R. Apt, Mona Rahn, Sunil Simon, Guido Schäfer
Publication date: 7 January 2015
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13129-0_37
Recommendations
Cited In (12)
- Coordination games on graphs
- Anti-coordination games and stable graph colorings
- Efficient equilibria in polymatrix coordination games
- Generalized graph \(k\)-coloring games
- Graphs and (levels of) cooperation in games: two ways how to allocate the surplus
- Equilibria and efficiency loss in games on networks
- Efficient Coordination in Weakest-Link Games
- A note on concurrent graph sharing games
- Coordination games on weighted directed graphs
- Coordination games on directed graphs
- The Impact of Complex and Informed Adversarial Behavior in Graphical Coordination Games
- A unified framework for strong price of anarchy in clustering games
This page was built for publication: Coordination games on graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937007)