Anti-coordination Games and Stable Graph Colorings
From MaRDI portal
Publication:2856137
DOI10.1007/978-3-642-41392-6_11zbMath1319.91047arXiv1308.3258OpenAlexW1556291219MaRDI QIDQ2856137
No author found.
Publication date: 23 October 2013
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3258
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
A Unified Framework for Strong Price of Anarchy in Clustering Games ⋮ Price of anarchy for graph coloring games with concave payoff ⋮ Incentive-based search for equilibria in Boolean games ⋮ Generalized graph \(k\)-coloring games ⋮ Stabilization Time in Weighted Minority Processes ⋮ Topological price of anarchy bounds for clustering games on networks ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks
This page was built for publication: Anti-coordination Games and Stable Graph Colorings
