{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:29:23Z","timestamp":1743100163327,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_6","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"46-57","source":"Crossref","is-referenced-by-count":3,"title":["The Price of Anarchy on Uniformly Related Machines Revisited"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 189\u2013198 (2007)","key":"6_CR1"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for List Schedules on Uniform Processors. SIAM Journal on Computing\u00a09(1), 91\u2013103 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A.: Selfish routing on the internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, vol.\u00a042, CRC Press, Boca Raton (2004)"},{"doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(1) (2007)","key":"6_CR4","DOI":"10.1145\/1186810.1186814"},{"unstructured":"Epstein, L.: Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. manuscript (2007)","key":"6_CR5"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"6_CR7","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)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-540-73420-8_51","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong price of anarchy for machine load balancing. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 583\u2013594. Springer, Heidelberg (2007)"},{"issue":"3","key":"6_CR9","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":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","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. 124\u2013134. Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT Schedules on Uniform Processors. SIAM Journal on Computing\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R. Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games and Economic Behavior\u00a021(1-2), 85\u2013101 (1997)","journal-title":"Games and Economic Behavior"},{"issue":"6","key":"6_CR13","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.G.: Approximate equilibria and ball fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (1999)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11758471_20","volume-title":"Algorithms and Complexity","author":"A. Kov\u00e1cs","year":"2006","unstructured":"Kov\u00e1cs, A.: Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 187\u2013198. Springer, Heidelberg (2006)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/S0097539799527969","volume":"27","author":"R. Li","year":"1998","unstructured":"Li, R., Shi, L.: An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing\u00a027(2), 414\u2013422 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","first-page":"349","volume-title":"Mathematical Foundations of Computer Science 1979","author":"J.W.S. Liu","year":"1979","unstructured":"Liu, J.W.S., Liu, C.L.: Bounds on scheduling algorithms for heterogeneous computing systems. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 349\u2013353. Springer, Heidelberg (1979)"},{"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)","key":"6_CR18","DOI":"10.1145\/380752.380846"},{"key":"6_CR19","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"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749\u2013753 (2001)","key":"6_CR20","DOI":"10.1145\/380752.380883"},{"key":"6_CR21","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":"6_CR22","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"},{"issue":"1","key":"6_CR23","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"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11944874_8","volume-title":"Internet and Network Economics","author":"M. Tennenholtz","year":"2006","unstructured":"Tennenholtz, M., Rozenfeld, O.: Strong and Correlated Strong Equilibria in Monotone Congestion Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 74\u201386. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:49:33Z","timestamp":1657561773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}