Simple local search problems that are hard to solve
SIAM Journal on Computing
Integer Linear Programs and Local Search for Max-Cut
SIAM Journal on Computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
The max k-cut game and its strong equilibria
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the verification and computation of strong nash equilibrium
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
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. Bounds on the price of anarchy for Nash equilibria and strong equilibria are also given. In particular, we show that the max cut game always admits a strong equilibrium and the strong price of anarchy is 2/3.