![](https://www.pdfsearch.io/img/c924e0e4c0a303b1b7f03f544c7262cf.jpg) Date: 2016-08-30 19:10:08
| | CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden†December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-timeAdd to Reading ListSource URL: theory.stanford.eduDownload Document from Source Website File Size: 174,06 KBShare Document on Facebook
|