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
- main_cup.pdfcolumbia.edu
- Nash equilibrium - Wikipediaen.wikipedia.org
- pnp.pdfscottaaronson.com
- Folk theorem (game theory) - Wikipediaen.wikipedia.org
- Reinforcement Learning in Newcomblike Problemsproceedings.neurips.cc
- Reasons to believescottaaronson.blog
- 370.pdfeprint.iacr.org
- P versus NP problem - Wikipediaen.wikipedia.org
- pasa.pdfmipmip.org
- [1508.04145] Reflective Oracles: A Foundation for Classical Game Theoryarxiv.org
- OsborneRubinsteinMasterpiece.pdfsites.math.rutgers.edu
- Robust Cooperation in the Prisoner's Dilemma — LessWronglesswrong.com