Revision as of 19:28, 8 October 2020 edit Citation bot (talk \| contribs) Bots 5,871,905 edits Add: s2cid, author pars. 1-1. Removed parameters. Some additions/deletions were actually parameter name changes. \| You can use this bot yourself. Report bugs here. \| Suggested by AManWithNoPlan \| All pages linked from cached copy of User:AManWithNoPlan/sandbox4 \| via #UCB_webform_linked ← Previous edit		Revision as of 18:10, 19 December 2020 edit undo Tom.Reding (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, Template editors 4,367,075 edits m Enum 2 author/editor WLs; WP:GenFixes on Tag: AWB Next edit →
Line 62: ===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 \|author1=[[Tim Roughgarden]] \|author-link=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\|doi=10.1137/070680096\|s2cid=2839399}}</ref> These concepts are counterparts to the notion of [[approximation ratio]] in algorithm design. ===Complexity of finding equilibria=== Line 85: [[Multi-agent systems]] And the area counts with diverse practical applications:<ref>{{cite book \|author1=[[Tim Roughgarden]] \|author-link=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 125: ==References== {{Reflist}} ~~<references />~~ * [[John von Neumann]], [[Oskar Morgenstern]] (1944) ''[[Theory of Games and Economic Behavior]]''. Princeton Univ. Press. 2007 edition: {{ISBN\|978-0-691-13061-3}} *{{citation

Algorithmic game theory: Difference between revisions