simplified.pdf
people.csail.mit.edu · 8,256 words · saved by 1 readers
N/A
The Complexity of Computing a Nash Equilibrium∗ Constantinos Daskalakis Paul W. Goldberg Christos H. Papadimitriou Computer Science Division, Dept. of Computer Science, Computer Science Division, UC Berkeley University of Liverpool UC Berkeley costis@cs.berkeley.edu P.W.Goldberg@liver- christos@cs.berkeley.edu…
related reading
- Nash equilibrium - Wikipediaen.wikipedia.org
- main_cup.pdfcolumbia.edu
- Folk theorem (game theory) - Wikipediaen.wikipedia.org
- Focal point (game theory) - Wikipediaen.wikipedia.org
- Game theory - Wikipediaen.wikipedia.org
- OsborneRubinsteinMasterpiece.pdfsites.math.rutgers.edu
- Algorithmic Game Theory (CS364A), Fall 2013timroughgarden.org
- P versus NP problem - Wikipediaen.wikipedia.org
- pnp.pdfscottaaronson.com
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Ultimate Guide to Game Theory: Principles and Applicationsinvestopedia.com
- Nash Equilibria and Schelling Points — LessWronglesswrong.com