{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:37:33Z","timestamp":1725017853095},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,12]],"date-time":"2009-02-12T00:00:00Z","timestamp":1234396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00224-009-9187-5","type":"journal-article","created":{"date-parts":[[2009,2,11]],"date-time":"2009-02-11T18:25:18Z","timestamp":1234376718000},"page":"533-554","source":"Crossref","is-referenced-by-count":14,"title":["Competitive Online Multicommodity Routing"],"prefix":"10.1007","volume":"45","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,12]]},"reference":[{"key":"9187_CR1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/9.981725","volume":"47","author":"E. Altman","year":"2002","unstructured":"Altman, E., Basar, T., Jimenez, T., Shimkin, N.: Competitive routing in networks with polynomial costs. IEEE Trans. Autom. Control 47, 92\u201396 (2002)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9187_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proc. 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a032\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"key":"9187_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the L p norm. In: Proc. 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0383\u2013391 (1995)","DOI":"10.1109\/SFCS.1995.492494"},{"key":"9187_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/1060590.1060599","volume-title":"Proc. of the Thirty-seventh Annual ACM Symposium on Theory of Computing (STOC)","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the Thirty-seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 57\u201366. ACM Press, New York (2005)"},{"key":"9187_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"9187_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"9187_CR7","first-page":"258","volume":"12","author":"D. Braess","year":"1969","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1969)","journal-title":"Unternehmensforschung"},{"key":"9187_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Proc. of the 33rd International Colloquium of Automata, Languages and Programming (ICALP)","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Proc. of the 33rd International Colloquium of Automata, Languages and Programming (ICALP). LNCS, vol. 4051, pp. 311\u2013322. Springer, Berlin (2006)"},{"key":"9187_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/1060590.1060600","volume-title":"Proc. of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC)","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 67\u201373. ACM Press, New York (2005)"},{"key":"9187_CR10","doi-asserted-by":"crossref","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.E.: The impact of oligopolistic competition in networks. Oper. Res. (2009, in press)","DOI":"10.1287\/opre.1080.0653"},{"key":"9187_CR11","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29, 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9187_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Natl. Bur. Stand., Sect. B 73, 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bur. Stand., Sect. B"},{"key":"9187_CR13","doi-asserted-by":"crossref","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chic. J. Theor. Comput. Sci. Article\u00a01 (2008)","DOI":"10.4086\/cjtcs.2008.001"},{"key":"9187_CR14","series-title":"LNCS","volume-title":"Online Algorithms: The State of the Art","year":"2008","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. LNCS, vol.\u00a01442. Springer, Berlin (2008)"},{"key":"9187_CR15","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE J. Sel. Area Commun. 20, 756\u2013767 (2002)","journal-title":"IEEE J. Sel. Area Commun."},{"key":"9187_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B. Fortz","year":"2004","unstructured":"Fortz, B., Thorup, M.: Increasing internet capacity using local search. Comput. Optim. Appl. 29, 13\u201348 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9187_CR17","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9187_CR18","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"9187_CR19","unstructured":"Harks, T.: Multicommodity routing problems\u2014selfish behavior and online aspects. PhD thesis, TU Berlin (2007)"},{"key":"9187_CR20","series-title":"LNCS","first-page":"240","volume-title":"Proc. 4th International Workshop on Approximation and Online Algorithms (WAOA)","author":"T. Harks","year":"2006","unstructured":"Harks, T., Heinz, S., Pfetsch, M.E.: Competitive online multicommodity routing. In: Erlebach, T., Kaklamanis, C. (eds.) Proc. 4th International Workshop on Approximation and Online Algorithms (WAOA). LNCS, vol. 4368, pp. 240\u2013252. Springer, Berlin (2006)"},{"key":"9187_CR21","doi-asserted-by":"crossref","unstructured":"Harks, T., Heinz, S., Pfetsch, M.E., Vredeveld, T.: Online multicommodity routing with time windows. ZIB Report 07-22, Zuse Institute Berlin (2007)","DOI":"10.1007\/11970125_19"},{"key":"9187_CR22","unstructured":"Olver, N.: The price of anarchy and a priority-based model of routing. Master\u2019s thesis, McGill University, Montr\u00e9al (2006)"},{"key":"9187_CR23","doi-asserted-by":"crossref","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9187_CR24","unstructured":"Roughgarden, T.: Selfish routing with atomic players. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 973\u2013974 (2005)"},{"key":"9187_CR25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49, 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9187_CR26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., Toth, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47, 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"9187_CR27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. of the Institute of Civil Engineers 1, 325\u2013378 (1952)","journal-title":"Proc. of the Institute of Civil Engineers"},{"key":"9187_CR28","doi-asserted-by":"crossref","unstructured":"Yahaya, A., Suda, T.: iREX: Inter-domain QoS automation using economics. In: Proc. of IEEE Consumer Communications and Networking Conference, pp. 96\u2013101 (2006)","DOI":"10.1109\/CCNC.2006.1592995"},{"key":"9187_CR29","first-page":"50","volume":"5","author":"A. Yahaya","year":"2008","unstructured":"Yahaya, A., Harks, T., Suda, T.: iREX: Efficient automation architecture for the deployment of inter-domain QoS policy. Netw. Service Manag. 5, 50\u201364 (2008)","journal-title":"Netw. Service Manag."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9187-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9187-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9187-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T15:50:04Z","timestamp":1633103404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9187-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,12]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9187-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,12]]}}}