Algorithmic game theory: Difference between revisions

Content deleted Content added
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.1
Line 39:
{{main|Price of Anarchy}}
The other two papers cited in the 2012 Gödel Prize for fundamental contributions to Algorithmic Game Theory introduced and developed the concept of "Price of Anarchy".
In their 1999 paper "Worst-case Equilibria",<ref name = "kp">{{Cite journal|title=Worst-case Equilibria|first=Elias|last=Koutsoupias|first2=Christos|last2=Papadimitriou|journal=Computer Science Review|volume=3|issue=2|date=May 2009|pages=65–69|url=http://www.cs.berkeley.edu/~christos/nash.ps|doi=10.1016/j.cosrev.2009.04.003|access-date=2018-01-08|archive-url=https://web.archive.org/web/20160313023635/http://www.cs.berkeley.edu/~christos/nash.ps|archive-date=2016-03-13|url-status=dead}}</ref> Koutsoupias and [[Christos Papadimitriou|Papadimitriou]] proposed a new measure of the degradation of system efficiency due to the selfish behavior of its agents: the ratio of between system efficiency at an optimal configuration, and its efficiency at the worst Nash equilibrium.
(The term "Price of Anarchy" only appeared a couple of years later.<ref>{{citation
| last = Papadimitriou | first = Christos | author-link = Christos Papadimitriou