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.
منابع مشابه
The Max k-Cut Game and Its Strong Equilibria
An instance of the max k−cut game is an edge weighted graph. Every vertex is controlled by an autonomous agent with strategy space [1..k]. Given a player i, his payoff is defined as the total weight of the edges [i, j] such that player j’s strategy is different from player i’s strategy. The social welfare is defined as the weight of the cut, i.e. half the sum of the players payoff. It is known ...
متن کاملOn Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG
Unique Games Conjecture (UGC), proposed by [24], lies in the center of many inapproximability results. At the heart of UGC lies approximability of MAX-CUT, which is a special instance of Unique Game. [25, 29] showed that assuming Unique Games Conjecture, it is NPhard to distinguish between MAX-CUT instance that has a value 1 − ε vs. 1 − Ω( √ ε). [14] then showed a matching polynomial time algor...
متن کاملA Shared-Constraint Approach to Multi-leader Multi-follower Games
Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even loca...
متن کاملMultilevel Network Games
We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The n nodes are connected by a static network and each node can decide individually to become a gateway to the high-speed network. The goal of a node v is to minimize its private costs, i.e., the sum (SUM-game) or maximum (MAXgame) of communication distances from v to ...
متن کاملCoordination Games on Graphs
We introduce natural strategic games on graphs, which capture the idea of coordination in a local setting. We show that these games have an exact potential and have strong equilibria when the graph is a pseudoforest. We also exhibit some other classes of graphs for which a strong equilibrium exists. However, in general strong equilibria do not need to exist. Further, we study the (strong) price...
متن کامل