6 search results - page 1 / 2 » On Strong Equilibria in the Max Cut Game |
WINE
2009
Springer
13 years 9 months ago
2009
Springer
This paper deals with two games defined upon well known generalizations of max cut. We study the existence of a strong equilibrium which is a refinement of the Nash equilibrium. ...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
SIGECOM
2010
ACM
13 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...