{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:27:06Z","timestamp":1743100026819,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240237"},{"type":"electronic","value":"9783319240244"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_14","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:00:10Z","timestamp":1441353610000},"page":"223-241","source":"Crossref","is-referenced-by-count":2,"title":["A Selective Tour Through Congestion Games"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structre on congestion games. J. Assoc. Comput. Mach. 55(6), 1\u201322 (2008)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"14_CR2","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":"14_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0024-3795(94)90357-3","volume":"99","author":"I Alth\u00f6fer","year":"1994","unstructured":"Alth\u00f6fer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra Appl. 99, 339\u2013355 (1994)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-540-92185-1_73","volume-title":"Internet and Network Economics","author":"I Ashlagi","year":"2008","unstructured":"Ashlagi, I., Krysta, P., Tennenholtz, M.: Social context games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 675\u2013683. Springer, Heidelberg (2008)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"14_CR7","unstructured":"Barman, S.: Approximating Carath\u00e9odory\u2019s theorem and nash equilibria. In: Proceedings of the 47th ACM Symposium on Theory of Computing (STOC 2015) (2015)"},{"key":"14_CR8","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.1100.0442","volume":"35","author":"V Bonifaci","year":"2010","unstructured":"Bonifaci, V., Harks, T., Sch\u00e4fer, G.: Stackelberg routing in arbitrary networks. Math. Oper. Res. 35(2), 330\u2013346 (2010)","journal-title":"Math. Oper. Res."},{"key":"14_CR10","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein paradox aus der Verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"3","key":"14_CR11","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"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1868237.1868251","volume":"7","author":"I Caragiannis","year":"2010","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. ACM Trans. Algorithms 7(1), 13 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of anarchy of finite congestion games. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-17572-5_16","volume-title":"Internet and Network Economics","author":"F Chung","year":"2010","unstructured":"Chung, F., Young, S.J.: Braess\u2019s paradox in large sparse graphs. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 194\u2013208. Springer, Heidelberg (2010)"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","volume":"72","author":"R Cole","year":"2006","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3), 444\u2013467 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier, N.E.: Moses. selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Stier-Moses, N.E.: Stackelberg Routing in Atomic Network Games. In: Technical report DRO-2007-03, Columbia Business School (2007)","DOI":"10.2139\/ssrn.987115"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"issue":"1","key":"14_CR21","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. Theory Comput. Syst. 47(1), 218\u2013249 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00224-009-9205-7","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. Theory Comput. Syst. 47(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00224-011-9355-2","volume":"50","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Gkatzelis, V., Kaporis, A.C., Spirakis, P.G.: The impact of social ignorance on weighted congestion games. Theory Comput. Syst. 50(3), 559\u2013578 (2012)","journal-title":"Theory Comput. Syst."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.04.033","volume":"448","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Efficient methods for selfish network design. Theor. Comput. Sci. 448, 9\u201320 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-45046-4_16","volume-title":"Web and Internet Economics","author":"D Fotakis","year":"2013","unstructured":"Fotakis, D., Kaporis, A.C., Lianeas, T., Spirakis, P.G.: Resolving braess\u2019s paradox in random networks. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 188\u2013201. Springer, Heidelberg (2013)"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-009-9198-2","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Atomic congestion games: fast, myopic and concurrent. Theory Comput. Syst. 47(1), 38\u201359 (2010)","journal-title":"Theory Comput. Syst."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.04.033","volume":"448","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Efficient methods for selfish network design. Theor. Comput. Sci. 448, 9\u201320 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-16170-4_15","volume-title":"Algorithmic Game Theory","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D., Karakostas, G., Kolliopoulos, S.G.: On the existence of optimal taxes for network congestion games with heterogeneous users. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 162\u2013173. Springer, Heidelberg (2010)"},{"issue":"36","key":"14_CR29","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36), 3305\u20133326 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S.C., Spirakis, P.G.: Selfish unsplittable flows. Theor. Comput. Sci. 348, 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11671411_13","volume-title":"Approximation and Online Algorithms","author":"DA Fotakis","year":"2006","unstructured":"Fotakis, D.A., Kontogiannis, S.C., Spirakis, P.G.: Symmetry in network congestion games: pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 161\u2013175. Springer, Heidelberg (2006)"},{"issue":"4","key":"14_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/15427951.2008.10129175","volume":"5","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D., Spirakis, P.G.: Cost-balancing tolls for atomic network congestion games. Internet Math. 5(4), 343\u2013363 (2008)","journal-title":"Internet Math."},{"issue":"7","key":"14_CR33","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":"14_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00224-011-9315-x","volume":"49","author":"T Harks","year":"2011","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1), 46\u201370 (2011)","journal-title":"Theory Comput. Syst."},{"key":"14_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R Holzman","year":"2003","unstructured":"Holzman, R., Law-Yone, N.: (Lev-tov). Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46, 193\u2013205 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"8\u201310","key":"14_CR36","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.tcs.2008.11.002","volume":"410","author":"AC Kaporis","year":"2009","unstructured":"Kaporis, A.C., Spirakis, P.G.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8\u201310), 745\u2013755 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"issue":"1","key":"14_CR38","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"},{"issue":"1","key":"14_CR39","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"YA Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE\/ACM Trans. Networking 5(1), 161\u2013173 (1997)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36, 683\u2013693 (2003)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"14_CR41","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, C.H.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"issue":"3","key":"14_CR43","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. Theor. Comput. Sci. 406(3), 187\u2013206 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR44","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. Algorithmica 48(1), 91\u2013126 (2007)","journal-title":"Algorithmica"},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games Econ. Behav. 57, 321\u2013346 (2006)","journal-title":"Games Econ. Behav."},{"key":"14_CR46","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"14_CR47","first-page":"1","volume":"11","author":"PN Panagopoulou","year":"2006","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1\u201319 (2006)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"14_CR48","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"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 2002), pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"issue":"2","key":"14_CR50","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":"5","key":"14_CR51","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of Braess\u2019s paradox: designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5), 922\u2013953 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR52","unstructured":"Swamy, C.: The effectiveness of stackelberg strategies and tolls for network congestion games. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1133\u20131142 (2007)"},{"issue":"4","key":"14_CR53","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/rsa.20325","volume":"37","author":"G Valiant","year":"2010","unstructured":"Valiant, G., Roughgarden, T.: Braess\u2019s paradox in large random graphs. Random Struct. Algorithms 37(4), 495\u2013515 (2010)","journal-title":"Random Struct. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T01:45:16Z","timestamp":1567129516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}