Revision as of 06:10, 26 June 2019 edit Aviad.rubinstein (talk \| contribs) 143 edits →Areas of research: Added a short blurb about computational social choice. ← Previous edit		Revision as of 14:00, 30 June 2019 edit undo AManWithNoPlan (talk \| contribs) Extended confirmed users 100,078 edits Alter: author4. Add: doi, title, issue, volume, author pars. 4-4. Removed URL that duplicated unique identifier. Converted bare reference to cite template. \| You can use this tool yourself. Report bugs here. Next edit →
Line 63: ===Inefficiency of equilibria=== The concepts of [[price of anarchy]] and [[price of stability]] were introduced to capture the loss in performance of a system due to the selfish behavior of its participants. The [[price of anarchy]] captures the worst case performance of the system at [[equilibrium]] relative to the optimal performance possible.<ref>{{cite book \| authors=[[Tim Roughgarden]] \|title=Selfish routing and the price of anarchy \|publisher=[[MIT Press]] \|year=2005 \|isbn=0-262-18243-2 }}</ref> The [[price of stability]], on the other hand, captures the relative performance of the best equilibrium of the system.<ref>{{Cite journal\|first1=Elliot\|last1=Anshelevich\|first2=Anirban\|last2=Dasgupta\|first3=Jon\|last3=Kleinberg\|first4=Éva\|last4=Tardos\|first5=Tom\|last5=Wexler\|first6=Tim\|last6=Roughgarden\|title=The Price of Stability for Network Design with Fair Cost Allocation\|journal=SIAM J. Comput.\|volume=38\|issue=4\|year=2008\|pages=~~1602-1623~~1602–1623\|doi=10.1137/070680096}}.</ref> These concepts are counterparts to the notion of [[approximation ratio]] in algorithm design. ===Complexity of finding equilibria=== Line 87: [[Multi-agent systems]] And the area counts with diverse practical applications:<ref>{{cite book \| authors=[[Tim Roughgarden]] \|title=Twenty lectures on algorithmic game theory \|publisher=[[Cambridge University Press]] \|year=2016 \|isbn=9781316624791}}</ref><ref>{{Cite web \| url=http://www.sigecom.org/ec19/callforpapers.html \|title = EC'19 \|\| 20th ACM Conference on Economics and Computation}}</ref> * [[Sponsored search auction]]s Line 115: \| last2 = Fleischer \| first2 = Lisa \| last3 = Hartline \| first3 = Jason \| author4 = [[Tim Roughgarden]] \| title = Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2011 \| journal = [[Games and Economic Behavior]] \| volume = 92 \| pages = ~~228-231~~228–231 \| year = 2015 \| author4-link = Tim Roughgarden ~~\| url = https://www-sciencedirect-com.stanford.idm.oclc.org/science/article/pii/S0899825615000330?via%3Dihub~~ \| doi = 10.1016/j.geb.2015.02.011 }}</ref>, Economics journals such as [[Econometrica]], and Computer Science journals such as [[SIAM Journal of Computing\|SICOMP]]<ref> [https://www-siam-org.stanford.idm.oclc.org/Publications/Journals/SIAM-Journal-on-Computing-SICOMP SICOMP]</ref>. ==See also==

Algorithmic game theory: Difference between revisions