Sciweavers

60 search results - page 5 / 12
» The Price of Anarchy in Cooperative Network Creation Games
Sort
View
MST
2010
196views more  MST 2010»
13 years 2 months ago
Non-Cooperative Cost Sharing Games via Subsidies
We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of ...
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ar...
ICALP
2011
Springer
12 years 11 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
INFOCOM
2009
IEEE
14 years 2 months ago
Protecting Against Network Infections: A Game Theoretic Perspective
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
Jasmina Omic, Ariel Orda, Piet Van Mieghem
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 7 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
INFOCOM
2006
IEEE
14 years 1 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda