{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T05:33:41Z","timestamp":1789018421457,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_28","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"311-322","source":"Crossref","is-referenced-by-count":57,"title":["Tight Bounds for Selfish and Greedy Load Balancing"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 493\u2013500 (1997)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010051","volume":"441","author":"A. Avidor","year":"2001","unstructured":"Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the L p norm. Algorithmica\u00a0441, 422\u2013441 (2001)","journal-title":"Algorithmica"},{"key":"28_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. of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 383\u2013391 (1995)","DOI":"10.1109\/SFCS.1995.492494"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 331-337 (2005)","DOI":"10.1145\/1060590.1060639"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"A.K. Chandra","year":"1975","unstructured":"Chandra, A.K., Wong, C.K.: Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing\u00a04(3), 249\u2013263 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/321921.321933","volume":"115","author":"R.A. Cody","year":"1976","unstructured":"Cody, R.A., Coffman, E.G.: Record allocation for minimizing expected retrieval costs on drum-like storage devices. Journal of the ACM\u00a0115, 103\u2013115 (1976)","journal-title":"Journal of the ACM"},{"key":"28_CR10","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413\u2013420 (2002)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: On the complexity of pure equilibria. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 613-622 (2004)","DOI":"10.1145\/1007352.1007446"},{"issue":"6","key":"28_CR15","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 of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"28_CR16","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.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"28_CR19","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.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games and the internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Phillips, S., Westbrook, J.: Online load balancing and network flow. In: Proc. of the 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp. 402\u2013411 (1993)","DOI":"10.1145\/167088.167201"},{"key":"28_CR22","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. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"2","key":"28_CR24","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, E.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior\u00a047(2), 389\u2013403 (2004)","journal-title":"Games and Economic Behavior"},{"issue":"6","key":"28_CR25","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. Shmoys","year":"1995","unstructured":"Shmoys, D., Wein, J., Williamson, D.: Scheduling parallel machines on-line. SIAM Journal on Computing\u00a024(6), 1313\u20131331 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proc. of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 188\u2013195 (2004)","DOI":"10.1145\/1007912.1007941"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T11:15:12Z","timestamp":1736421312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11786986_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}