The complexitiy of computing equilibria
Year of publication: |
[2015]
|
---|---|
Authors: | Papadimitriou, Christos H. |
Published in: |
Handbook of game theory ; Volume 4. - Amsterdam : Elsevier, North-Holland, ISBN 978-0-444-53766-9. - 2015, p. 779-810
|
Subject: | Computational complexity | Normal form game | Nash Equilibrium | Algorithm | Polynominaltime algorithm | NP-complete problems | PPAD-Completeness | Nash-Gleichgewicht | Nash equilibrium | Algorithmus | Nichtkooperatives Spiel | Noncooperative game | Theorie | Theory |
-
Chapter 14. The Complexity of Computing Equilibria
Papadimitriou, Christos, (2015)
-
How hard is it to find extreme Nash equilibria in network congestion games?
Gassner, Elisabeth, (2008)
-
Performance evaluation of a descent algorithm for bi-matrix games
Tsaknakis, Haralampos, (2008)
- More ...
-
Incentive-compatible interdomain routing with linear utilities
Hall, Alexander, (2007)
-
Papadimitriou, Christos H., (2008)
-
Experiments with an economic model of the worldwide web
Kouroupas, Georgios, (2005)
- More ...