Computing equilibria: a computational complexity perspective
Year of publication: |
2010
|
---|---|
Authors: | Roughgarden, Tim |
Published in: |
Economic Theory. - Springer. - Vol. 42.2010, 1, p. 193-236
|
Publisher: |
Springer |
Subject: | Equilibrium computation | Computational complexity | NP-completeness | PPAD-completeness |
-
The complexitiy of computing equilibria
Papadimitriou, Christos H., (2015)
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
-
Computational Approaches to Bargaining and Choice
Nurmi, Hannu, (1989)
- More ...
-
Selfish routing and the price of anarchy
Roughgarden, Tim, (2005)
-
Bounding the inefficiency of equilibria in nonatomic congestion games
Roughgarden, Tim, (2004)
-
Local smoothness and the price of anarchy in splittable congestion games
Roughgarden, Tim, (2015)
- More ...