{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:54:00Z","timestamp":1768557240154,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,17]],"date-time":"2010-07-17T00:00:00Z","timestamp":1279324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00453-010-9427-8","type":"journal-article","created":{"date-parts":[[2010,7,16]],"date-time":"2010-07-16T14:50:02Z","timestamp":1279291802000},"page":"606-637","source":"Crossref","is-referenced-by-count":69,"title":["Tight Bounds for Selfish and Greedy Load Balancing"],"prefix":"10.1007","volume":"61","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,17]]},"reference":[{"key":"9427_CR1","series-title":"LNCS","first-page":"218","volume-title":"Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS \u201906)","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS \u201906), LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Berlin (2006)"},{"key":"9427_CR2","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201997), pp. 493\u2013500 (1997)"},{"issue":"4","key":"9427_CR3","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., 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."},{"issue":"3","key":"9427_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","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 29(3), 422\u2013441 (2001)","journal-title":"Algorithmica"},{"key":"9427_CR5","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: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS \u201995), pp. 383\u2013391 (1995)","DOI":"10.1109\/SFCS.1995.492494"},{"key":"9427_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC \u201905), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"9427_CR7","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC \u201905), pp.\u00a0331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"key":"9427_CR8","unstructured":"Caragiannis, I.: Better bounds for online load balancing on unrelated machines. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201908), pp. 972\u2013981 (2008)"},{"issue":"3","key":"9427_CR9","doi-asserted-by":"crossref","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 J. Comput. 4(3), 249\u2013263 (1975)","journal-title":"SIAM J. Comput."},{"key":"9427_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC \u201905), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9427_CR11","series-title":"LNCS","first-page":"59","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms (ESA \u201905)","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: Proceedings of the 13th Annual European Symposium on Algorithms (ESA \u201905), LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Berlin (2005)"},{"key":"9427_CR12","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V., Sidiropoulos, A.: Convergence and approximation in potential games. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS \u201906), pp. 349\u2013260 (2006)","DOI":"10.1007\/11672142_28"},{"issue":"1","key":"9427_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/321921.321933","volume":"23","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. J. ACM 23(1), 103\u2013115 (1976)","journal-title":"J. ACM"},{"key":"9427_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/11786986_46","volume-title":"Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP \u201906)","author":"R. Cominetti","year":"2006","unstructured":"Cominetti, R., Correa, J.R., Stier Moses, N.E.: Network games with atomic players. In: Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP \u201906), LNCS, vol.\u00a04168, pp. 525\u2013536. Springer, Berlin (2006)"},{"key":"9427_CR15","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1), (2007)","DOI":"10.1145\/1186810.1186814"},{"key":"9427_CR16","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: On the complexity of pure equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC \u201904), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"36","key":"9427_CR17","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D. Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: 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."},{"issue":"2\u20133","key":"9427_CR18","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348(2\u20133), 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9427_CR19","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC \u201904), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"issue":"1\u20133","key":"9427_CR20","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tcs.2006.07.055","volume":"369","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1\u20133), 116\u2013135 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"9427_CR21","doi-asserted-by":"crossref","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":"6","key":"9427_CR22","doi-asserted-by":"crossref","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(6), 683\u2013693 (2003)","journal-title":"Theory Comput. Syst."},{"key":"9427_CR23","series-title":"LNCS","first-page":"404","volume-title":"Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS \u201999)","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS \u201999), LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Berlin (1999)"},{"issue":"3","key":"9427_CR24","doi-asserted-by":"crossref","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":"9427_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. Algorithmica 48(1), 91\u2013126 (2007)","journal-title":"Algorithmica"},{"key":"9427_CR26","doi-asserted-by":"crossref","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 Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"9427_CR27","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC \u201901), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9427_CR28","doi-asserted-by":"crossref","unstructured":"Phillips, S., Westbrook, J.: Online load balancing and network flow. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC \u201993), pp. 402\u2013411 (1993)","DOI":"10.1145\/167088.167201"},{"key":"9427_CR29","doi-asserted-by":"crossref","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"9427_CR30","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(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"9427_CR31","doi-asserted-by":"crossref","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 Econ. Behav. 47(2), 389\u2013403 (2004)","journal-title":"Games Econ. Behav."},{"issue":"6","key":"9427_CR32","doi-asserted-by":"crossref","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 J. Comput. 24(6), 1313\u20131331 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9427_CR33","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9427-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9427-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9427-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T23:59:13Z","timestamp":1740268753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9427-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,17]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9427"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9427-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,17]]}}}