9 search results - page 1 / 2 » The Max k-Cut Game and Its Strong Equilibria |
TAMC
2010
Springer
14 years 15 days ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
ESA
2010
Springer
13 years 8 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
WINE
2009
Springer
13 years 12 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. ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
MOR
2008
13 years 7 months ago
2008
We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local best-rep...