{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:28:10Z","timestamp":1750235290438},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_4","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"18-29","source":"Crossref","is-referenced-by-count":14,"title":["Competitive Routing over Time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. Journal of the ACM\u00a055(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/CBO9780511800481.020","volume-title":"Algorithmic Game Theory","author":"T. Roughgarden","year":"2007","unstructured":"Roughgarden, T.: Routing Games. In: Algorithmic Game Theory, pp. 461\u2013486. Cambridge University Press, Cambridge (2007)"},{"key":"4_CR5","unstructured":"Azar, Y., Jain, K., Mirrokni, V.S.: (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proc. 19th Symp. Discrete Algorithms (SODA), pp. 323\u2013332 (2008)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: Proc. 20th Symp. Discrete Algorithms (SODA), pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1017\/CBO9780511800481.022","volume-title":"Algorithmic Game Theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish Load Balancing. In: Algorithmic Game Theory, pp. 517\u2013542. Cambridge University Press, Cambridge (2007)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th Symp. Theory of Computing (STOC), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th Symp. Theory of Computing (STOC), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc. 41st Symp. Theory of Computing, STOC (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Ukkusuri, S.: Equilibria in dynamic selfish routing. In: Proc. 2nd Intl. Symp. Algorithmic Game Theory, SAGT (2009)","DOI":"10.1007\/978-3-642-04645-2_16"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chicago Journal of Theoretical Computer Science, Article no. 1 (2008)","DOI":"10.4086\/cjtcs.2008.001"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. In: Proc. 2nd Intl. Symp. Algorithmic Game Theory, SAGT (2009)","DOI":"10.1007\/978-3-642-04645-2_29"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11970125_19","volume-title":"Approximation and Online Algorithms","author":"T. Harks","year":"2007","unstructured":"Harks, T., Heinz, S., Pfetsch, M.: Competitive online multicommodity routing. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 240\u2013252. Springer, Heidelberg (2007)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proc. 17th Symp. Discrete Algorithms (SODA), pp. 668\u2013677 (2006)","DOI":"10.1145\/1109557.1109630"},{"key":"4_CR18","series-title":"Compurer Applications","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L.: Queueing Systems. Compurer Applications, vol.\u00a02. Wiley, Chichester (1976)"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A. Parekh","year":"1993","unstructured":"Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE\/ACM Transactions on Networking\u00a01(3), 344\u2013357 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"D\u00fcrr, C., Thang, N.K.: Non-clairvoyant scheduling games. In: Proc. 2nd Intl. Symp. Algorithmic Game Theory, SAGT (2009)","DOI":"10.1007\/978-3-642-04645-2_13"},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/957195.808056","volume":"7","author":"J. Bruno","year":"1973","unstructured":"Bruno, J., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing-time (extended abstract). SIGOPS Oper. Syst. Rev.\u00a07(4), 102\u2013103 (1973)","journal-title":"SIGOPS Oper. Syst. Rev."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:35:37Z","timestamp":1606185337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}