27 search results - page 4 / 6 » The Price of Anarchy for Polynomial Social Cost |
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...
SUTC
2010
IEEE
13 years 11 months ago
2010
IEEE
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
TCS
2010
13 years 5 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...