A Game Theoretic Approach for Efficient Graph Coloring

DOI10.1007/978-3-540-92182-0_19zbMath1183.68585OpenAlexW1821833955MaRDI QIDQ3596717

Panagiota N. Panagopoulou, Paul G. Spirakis

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_19

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

On the Nash number and the diminishing Grundy number of a graph ⋮ On spectrum sharing games ⋮ Unnamed Item ⋮ Non-existence of stable social groups in information-driven networks ⋮ Coordination Games on Weighted Directed Graphs ⋮ Coordination games on graphs ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Network Coloring and Colored Coin Games ⋮ Price of anarchy for graph coloring games with concave payoff ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Generalized graph \(k\)-coloring games ⋮ The Parallel Complexity of Coloring Games ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ How long does it take for all users in a social network to choose their communities?

This page was built for publication: A Game Theoretic Approach for Efficient Graph Coloring