The Max k-Cut Game and Its Strong Equilibria

DOI10.1007/978-3-642-13562-0_22zbMath1284.91076OpenAlexW1904955508MaRDI QIDQ3569079

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

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

Related Items (6)

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

This page was built for publication: The Max k-Cut Game and Its Strong Equilibria