{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T18:40:01Z","timestamp":1739472001487,"version":"3.37.0"},"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_22","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"232-243","source":"Crossref","is-referenced-by-count":10,"title":["Maximizing the Minimum Load: The Cost of Selfishness"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Elena","family":"Kleiman","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Symposium on Foundations of Computer Science (FOCS 2004), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(1) (2007)","DOI":"10.1145\/1186810.1186814"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"B.L. Deuermeyer","year":"1982","unstructured":"Deuermeyer, B.L., Friesen, D.K., Langston, M.A.: Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM Journal on Discrete Mathematics\u00a03(2), 190\u2013196 (1982)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 15\u201324 (2008)","DOI":"10.1109\/FOCS.2008.71"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11671411_9","volume-title":"Approximation and Online Algorithms","author":"T. Ebenlendr","year":"2006","unstructured":"Ebenlendr, T., Noga, J., Sgall, J., Woeginger, G.J.: A note on semi-online machine covering. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 110\u2013118. Springer, Heidelberg (2006)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-78773-0_23","volume-title":"LATIN 2008: Theoretical Informatics","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., van Stee, R.: Maximizing the minimum load for selfish agents. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 264\u2013275. Springer, Heidelberg (2008)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/1273340.1273348","volume":"3","author":"E. Even-Dar","year":"2007","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibrium in load balancing. ACM Trans. Algorithms\u00a03(3), 32 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT Numerical Mathematics\u00a019(3), 312\u2013320 (1979)","journal-title":"BIT Numerical Mathematics"},{"key":"22_CR11","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.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: 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)"},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing\u00a03(4), 299\u2013325 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR13","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.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. Journal of the ACM\u00a032(3), 562\u2013572 (1985)","journal-title":"Journal of the ACM"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: 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"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"22_CR18","volume-title":"Selfish routing and the price of anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. MIT Press, Cambridge (2005)"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Sahasrabudhe, A., Kar, K.: Bandwidth allocation games under budget and access constraints. In: CISS, pp. 761\u2013769 (2008)","DOI":"10.1109\/CISS.2008.4558623"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"19","author":"P. Schuurman","year":"2007","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. INFORMS Journal on Computing\u00a019(1), 52\u201363 (2007)","journal-title":"INFORMS Journal on Computing"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T18:10:19Z","timestamp":1739470219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}