On Strong Equilibria in the Max Cut Game

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.

• Type: Conference
• Year: 2009
• Where: WINE
• Authors: Laurent Gourvès, Jérôme Monnot
• Keywords: MAX CUT, Nash Equilibrium, Strong Equilibrium, WINE 2009