Sciweavers

SOFSEM
2009
Springer
14 years 1 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
STOC
2004
ACM
96views Algorithms» more  STOC 2004»
14 years 4 months ago
The complexity of pure Nash equilibria
Alex Fabrikant, Christos H. Papadimitriou, Kunal T...
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