{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:10:09Z","timestamp":1748715009031,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"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_28","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"384-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bottleneck Routing with Elastic Demands"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner, R., Orda, A.: Bottleneck routing games in communication networks. IEEE J. Sel. Area Commun. 25(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Sel. Area Commun."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Busch, C., Kannan, R., Samman, A.: Bottleneck routing games on grids. In: Proceedings 2nd International ICST Conference on Game Theory for Networks, pp. 294\u2013307 (2011)","DOI":"10.1007\/978-3-642-30373-9_21"},{"issue":"36","key":"28_CR3","doi-asserted-by":"publisher","first-page":"3337","DOI":"10.1016\/j.tcs.2009.04.015","volume":"410","author":"C Busch","year":"2009","unstructured":"Busch, C., Magdon-Ismail, M.: Atomic routing games on maximum congestion. Theor. Comput. Sci. 410(36), 3337\u20133347 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/11602613_81","volume-title":"Algorithms and Computation","author":"I Caragiannis","year":"2005","unstructured":"Caragiannis, I., Galdi, C., Kaklamanis, C.: Network load games. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 809\u2013818. Springer, Heidelberg (2005)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 668\u2013677 (2006)","DOI":"10.1145\/1109557.1109630"},{"issue":"1\u20132","key":"28_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10107-013-0719-z","volume":"147","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Guzman, C.: Network congestion control with markovian multipath routing. Math. Program. Ser. A 147(1\u20132), 231\u2013251 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-16170-4_29","volume-title":"Algorithmic Game Theory","author":"B de Keijzer","year":"2010","unstructured":"de Keijzer, B., Sch\u00e4fer, G., Telelis, O.A.: On the inefficiency of equilibria in linear bottleneck congestion games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 335\u2013346. Springer, Heidelberg (2010)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Gai, Y., Liu, H., Krishnamachari, B.: A packet dropping mechanism for efficient operation of $$M\/M\/1$$ queues with selfish users. In: Proceedings of the 30th IEEE International Conference on Computer Communications, pp. 2687\u20132695 (2011)","DOI":"10.1109\/INFCOM.2011.5935098"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TNET.2006.886738","volume":"16","author":"H Han","year":"2006","unstructured":"Han, H., Shakkottai, S., Hollot, C.V., Srikant, R., Towsley, D.F.: Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet. IEEE\/ACM Trans. Netw. 16(6), 1260\u20131271 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-012-0521-3","volume":"141","author":"T Harks","year":"2013","unstructured":"Harks, T., Hoefer, M., Klimm, M., Skopalik, A.: Computing pure nash and strong equilibria in bottleneck congestion games. Math. Program. Ser. A 141, 193\u2013215 (2013)","journal-title":"Math. Program. Ser. A"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Harks, T., Hoefer, M., Schewior, K., Skopalik, A.: Routing games with progressive filling. In: Proceedings of the 33rd IEEE International Conference on Computer Communications, pp. 352\u2013360 (2014)","DOI":"10.1109\/INFOCOM.2014.6847957"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M.: Congestion games with variable demands. In: Apt, K. (ed.) Proceedings of the 13th Conference Theoretical Aspects of Rationality and Knowledge, pp. 111\u2013120 (2011)","DOI":"10.1145\/2000378.2000391"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M.: Equilibria in a class of aggregative location games. J. Math. Econom. (2015) forthcoming","DOI":"10.1016\/j.jmateco.2015.09.006"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-012-0322-1","volume":"42","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.: Strong equilibria in games with the lexicographical improvement property. Internat. J. Game Theory 42(2), 461\u2013482 (2012)","journal-title":"Internat. J. Game Theory"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1215\/S0012-7094-41-00838-4","volume":"8","author":"S Kakutani","year":"1941","unstructured":"Kakutani, S.: A generalization of Brouwer\u2019s fixed point theorem. Duke Math. J. 8(3), 457\u2013458 (1941)","journal-title":"Duke Math. J."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-16170-4_20","volume-title":"Algorithmic Game Theory","author":"R Kannan","year":"2010","unstructured":"Kannan, R., Busch, C.: Bottleneck congestion games with logarithmic price of anarchy. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 222\u2013233. Springer, Heidelberg (2010)"},{"key":"28_CR17","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-30373-9_22","volume-title":"Game Theory for Networks","author":"R Kannan","year":"2012","unstructured":"Kannan, R., Busch, C., Vasilakos, A.V.: Optimal price of anarchy of polynomial and super-polynomial bottleneck congestion games. In: Jain, R., Kannan, R. (eds.) GAMENETS 2011. LNICST, vol. 75, pp. 308\u2013320. Springer, Heidelberg (2012)"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F Kelly","year":"1998","unstructured":"Kelly, F., Maulloo, A., Tan, D.: Rate control in communication networks: Shadow prices, proportional fairness, and stability. J. Oper. Res. Soc. 49, 237\u2013252 (1998)","journal-title":"J. Oper. Res. Soc."},{"key":"28_CR19","volume-title":"An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network","author":"S Keshav","year":"1997","unstructured":"Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, Boston (1997)"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1866739.1866762","volume":"54","author":"PB Key","year":"2011","unstructured":"Key, P.B., Massouli\u00e9, L., Towsley, D.F.: Path selection and multipath congestion control. Commun. ACM 54(1), 109\u2013116 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1639562.1639587","volume":"37","author":"PB Key","year":"2009","unstructured":"Key, P.B., Proutiere, A.: Routing games with elastic traffic. SIGMETRICS Perform. Eval. Rev. 37(2), 63\u201364 (2009)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1145\/210346.210415","volume":"42","author":"Y Korilis","year":"1995","unstructured":"Korilis, Y., Lazar, A.: On the existence of equilibria in noncooperative optimal flow control. J. ACM 42(3), 584\u2013613 (1995)","journal-title":"J. ACM"},{"key":"28_CR23","unstructured":"Kukushkin, N.: Acyclicity of improvements in games with common intermediate objectives. Russian Academy of Sciences, Dorodnicyn Computing Center, Moscow (2004)"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00182-007-0090-5","volume":"36","author":"N Kukushkin","year":"2007","unstructured":"Kukushkin, N.: Congestion games revisited. Internat. J. Game Theory 36, 57\u201383 (2007)","journal-title":"Internat. J. Game Theory"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Miller, K., Harks, T.: Utility max-min fair congestion control with time-varying delays. In: Proceedings of the 27th IEEE International Conference on Computer Communicatins, pp. 331\u2013335 (2008)","DOI":"10.1109\/INFOCOM.2008.75"},{"issue":"5","key":"28_CR26","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1109\/TNET.2008.2011902","volume":"17","author":"F Paganini","year":"2009","unstructured":"Paganini, F., Mallada, E.: A unified approach to congestion control and node-based multipath routing. IEEE\/ACM Trans. Netw. 17(5), 1413\u20131426 (2009)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"28_CR27","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TNET.2006.880179","volume":"14","author":"L Qiu","year":"2006","unstructured":"Qiu, L., Yang, Y., Zhang, Y., Shenker, S.: On selfish routing in Internet-like environments. IEEE\/ACM Trans. Netw. 14(4), 725\u2013738 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"28_CR29","volume-title":"Urban Transp. Netw.","author":"Y Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transp. Netw. Prentice-Hall, Upper Saddle River (1985)"},{"key":"28_CR30","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1109\/49.414637","volume":"13","author":"S Shenker","year":"1995","unstructured":"Shenker, S.: Fundamental design issues for the future Internet. IEEE J. Sel. Area Commun. 13, 1176\u20131188 (1995)","journal-title":"IEEE J. Sel. Area Commun."},{"key":"28_CR31","volume-title":"The Mathematics of Internet Congestion Control","author":"R Srikant","year":"2003","unstructured":"Srikant, R.: The Mathematics of Internet Congestion Control. Birkh\u00e4user, Basel (2003)"},{"issue":"6","key":"28_CR32","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1109\/TNET.2007.899011","volume":"15","author":"T Voice","year":"2007","unstructured":"Voice, T.: Stability of multi-path dual congestion control algorithms. IEEE\/ACM Trans. Netw. 15(6), 1231\u20131239 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Wardrop, J.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers (Part II), vol. 1, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"},{"key":"28_CR34","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/LCOMM.2003.818888","volume":"7","author":"B Wydrowski","year":"2003","unstructured":"Wydrowski, B., Andrew, L.L.H., Zukerman, M.: Maxnet: a congestion control architecture for scalable networks. IEEE Commun. Lett. 7, 511\u2013513 (2003)","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"28_CR35","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1109\/TNET.2013.2247416","volume":"21","author":"D Yang","year":"2013","unstructured":"Yang, D., Xue, G., Fang, X., Misra, S., Zhang, J.: A game-theoretic approach to stable routing in max-min fair networks. IEEE\/ACM Trans. Netw. 21(6), 1947\u20131959 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"28_CR36","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TNET.2007.896169","volume":"15","author":"Y Zhang","year":"2007","unstructured":"Zhang, Y., Kang, S., Loguinov, D.: Delay-independent stability and performance of distributed congestion control. IEEE\/ACM Trans. Netw. 15(4), 838\u2013851 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"28_CR37","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1016\/j.comnet.2007.11.021","volume":"52","author":"Y Zhang","year":"2008","unstructured":"Zhang, Y., Leonard, D., Loguinov, D.: Jetmax: scalable max-min congestion control for high-speed heterogeneous networks. Comput. Netw. 52(6), 1193\u20131219 (2008)","journal-title":"Comput. Netw."},{"issue":"5","key":"28_CR38","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TAC.2009.2013005","volume":"54","author":"Y Zhang","year":"2009","unstructured":"Zhang, Y., Loguinov, D.: On delay-independent diagonal stability of max-min congestion control. IEEE Trans. Autom. Control 54(5), 1111\u20131116 (2009)","journal-title":"IEEE Trans. Autom. Control"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:54:03Z","timestamp":1748714043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_28","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"}}]}}