The max k-cut game and its strong equilibria

DOI10.1007/978-3-642-13562-0_22MaRDI QIDQ3569079zbMATH OpenOpenAlexFDO

Authors Laurent Gourvès, Jérôme Monnot

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)

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

Cited in

(10)

• Coordination games on graphs
• Generalized graph k-coloring games
• Topological price of anarchy bounds for clustering games on networks
• Strategic multiway cut and multicut games
• Coordination games on weighted directed graphs
• Optimal colorings of Max k-Cut game
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• A unified framework for strong price of anarchy in clustering games
• Coalition resilient outcomes in max k-cut 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)