{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:34Z","timestamp":1792111474780,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_398","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"2078-2083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stackelberg Games: The Price of Optimum"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Kaporis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"398_CR19743","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63343-X_35","volume-title":"Building secure and reliable network applications","author":"K Birman","year":"1997","unstructured":"Birman K (1997) Building secure and reliable network applications. Manning, Greenwich"},{"key":"398_CR19744","unstructured":"Douligeris C, Mazumdar R (2006) Multilevel flow control of queues. In: Johns Hopkins conference on information sciences, Baltimore, 22\u201324 Mar 1989"},{"key":"398_CR19745","unstructured":"Economides A, Silvester, J (1990) Priority load sharing: an approach using Stackelberg games. In: 28th annual Allerton conference on communications, control and computing, Monticello"},{"issue":"8\u201310","key":"398_CR19746","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.tcs.2008.11.002","volume":"410","author":"AC Kaporis","year":"2009","unstructured":"Kaporis AC, Spirakis PG (2009) The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor Comput Sci 410(8\u201310):745\u2013755","journal-title":"Theor Comput Sci"},{"issue":"1","key":"398_CR19747","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/s00453-007-9018-5","volume":"53","author":"G Karakostas","year":"2009","unstructured":"Karakostas G, Kolliopoulos SG (2009) Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica 53(1):132\u2013153","journal-title":"Algorithmica"},{"issue":"1","key":"398_CR19748","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"YA Korilis","year":"1997","unstructured":"Korilis YA, Lazar AA, Orda A (1997) Achieving network optima using stackelberg routing strategies. IEEE\/ACM Trans Netw 5(1):161\u2013173","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"398_CR19749","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou CH (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369","journal-title":"Comput Sci Rev"},{"key":"398_CR19750","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-45465-9_66","volume-title":"29th international colloquium, automata, languages and programming","author":"VSA Kumar","year":"2002","unstructured":"Kumar VSA, Marathe MV (2002) Improved results for Stackelberg scheduling strategies. In: 29th international colloquium, automata, languages and programming, M\u00e1laga. LNCS. Springer, pp\u00a0776\u2013787"},{"key":"398_CR19751","doi-asserted-by":"crossref","unstructured":"Roughgarden T (2001) Designing networks for selfish users is hard. In: 42nd IEEE annual symposium of foundations of computer science, Las Vegas, pp\u00a0472\u2013481","DOI":"10.1109\/SFCS.2001.959923"},{"issue":"2","key":"398_CR19752","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden T (2004) Stackelberg scheduling strategies. SIAM J Comput 33(2):332\u2013350","journal-title":"SIAM J Comput"},{"key":"398_CR19753","unstructured":"Roughgarden T 2002 Selfish routing. Dissertation, Cornell University. http:\/\/theory.stanford.edu\/~tim\/"},{"key":"398_CR19754","doi-asserted-by":"crossref","unstructured":"Roughgarden T (2005) Selfish routing and the price of anarchy. MIT, Cambridge (2005)","DOI":"10.21236\/ADA637949"},{"issue":"2","key":"398_CR19755","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259","journal-title":"J ACM"},{"key":"398_CR19756","volume-title":"The effectiveness of Stackelberg strategies and tolls for network congestion games","author":"C Swamy","year":"2007","unstructured":"Swamy C (2007) The effectiveness of Stackelberg strategies and tolls for network congestion games. In: ACM-SIAM symposium on discrete algorithms, Philadelphia"},{"key":"398_CR19757","volume-title":"Marktform und Gleichgewicht","author":"H von Stackelberg","year":"1934","unstructured":"von Stackelberg H (1934) Marktform und Gleichgewicht. Springer, Vienna"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:53:49Z","timestamp":1792108429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_398","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}