{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:09Z","timestamp":1759638009160,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_10","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"132-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Stackelberg Strategies in Affine Congestion Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211\u20131233 (2011)","journal-title":"SIAM J. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, L.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 57\u201366. ACM Press (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. ACM Trans. Econ. Comput. 2(4), 14 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica 61(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 67\u201373. ACM Press (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Stier Moses, N.E.: Stackelberg routing in atomic network games. Technical report DRO-2007-03, Columbia Business School (2007)","DOI":"10.2139\/ssrn.987115"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s00224-008-9152-8","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. Theor. Comput. Syst. 47(1), 218\u2013249 (2010)","journal-title":"Theor. Comput. Syst."},{"issue":"7","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1016\/j.jcss.2008.07.001","volume":"74","author":"M Gairing","year":"2008","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74(7), 1199\u20131225 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10_CR10","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, S.: Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica 53(1), 132\u2013153 (2009)","journal-title":"Algorithmica"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. Theoret. Comput. Sci. 406(3), 187\u2013206 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM J. Comput. 33(2), 332\u2013350 (2004)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/2209249.2209274","volume":"55","author":"T Roughgarden","year":"2012","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. Commun. ACM 55(7), 116\u2013123 (2012)","journal-title":"Commun. ACM"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/2344422.2344426","volume":"8","author":"C Swamy","year":"2012","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. ACM Trans. Algorithms 8(4), 36 (2012)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:14:09Z","timestamp":1703754849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}