6 search results - page 1 / 2 » On Pure and (approximate) Strong Equilibria of Facility Loca... |
80
Voted
CORR
2008
Springer
14 years 10 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...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
88
Voted
TCS
2010
14 years 8 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
87
Voted
SIGECOM
2010
ACM
14 years 10 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....
86
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbi...