The max k-cut game and its strong equilibria

DOI10.1007/978-3-642-13562-0_22zbMATH Open1284.91076OpenAlexW1904955508MaRDI QIDQ3569079FDOQ3569079

Jérôme Monnot, Laurent Gourvès

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_22

Mathematics Subject Classification ID

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

Cited In (7)

• Coordination games on graphs
• Generalized graph \(k\)-coloring games
• A Unified Framework for Strong Price of Anarchy in Clustering Games
• Coordination Games on Weighted Directed Graphs
• Topological price of anarchy bounds for clustering games on networks
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• Coalition resilient outcomes in max \(k\)-cut games

   Recommendations

• Coalition resilient outcomes in max \(k\)-cut games 👍 👎
• Coordination games on graphs 👍 👎
• Generalized graph \(k\)-coloring games 👍 👎
• Generalized graph \(k\)-coloring games 👍 👎
• Strategic multiway cut and multicut games 👍 👎

This page was built for publication: The max \(k\)-cut game and its strong equilibria

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