First Page | Document Content | |
---|---|---|
Date: 2016-08-30 19:04:46 | CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routingAdd to Reading ListSource URL: theory.stanford.eduDownload Document from Source WebsiteFile Size: 136,49 KBShare Document on Facebook |