Sciweavers

19 search results - page 3 / 4
» The price of anarchy of finite congestion games
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 5 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
ICALP
2011
Springer
12 years 8 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
GLOBECOM
2009
IEEE
13 years 11 months ago
Price of Anarchy for Cognitive MAC Games
—In this paper, we model and analyze the interactions between secondary users in a spectrum overlay cognitive system as a cognitive MAC game. In this game, each secondary user ca...
Lok Man Law, Jianwei Huang, Mingyan Liu, Shuo-Yen ...
ICALP
2004
Springer
13 years 10 months ago
Coordination Mechanisms
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
George Christodoulou, Elias Koutsoupias, Akash Nan...
WINE
2009
Springer
171views Economy» more  WINE 2009»
13 years 11 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...