{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:05:31Z","timestamp":1709813131466},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T00:00:00Z","timestamp":1342137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00236-012-0163-1","type":"journal-article","created":{"date-parts":[[2012,7,12]],"date-time":"2012-07-12T04:38:37Z","timestamp":1342067917000},"page":"361-379","source":"Crossref","is-referenced-by-count":10,"title":["Inefficiency of equilibria for the machine covering game on uniform machines"],"prefix":"10.1007","volume":"49","author":[{"given":"Zhiyi","family":"Tan","sequence":"first","affiliation":[]},{"given":"Long","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Ren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,13]]},"reference":[{"key":"163_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"Andelman N., Feldman M., Mansour Y.: Strong price of anarchy. Games Econ. Behav. 65, 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"key":"163_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2009","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. SIAM J. Comput. 38, 1602\u20131623 (2009)","journal-title":"SIAM J. Comput."},{"key":"163_CR3","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, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"163_CR4","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(4) (2007)","DOI":"10.1145\/1219944.1219949"},{"key":"163_CR5","doi-asserted-by":"crossref","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 J. Discret. Math. 3, 190\u2013196 (1982)","journal-title":"SIAM J. Discret. Math."},{"key":"163_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.dam.2005.02.002","volume":"148","author":"L. Epstein","year":"2005","unstructured":"Epstein L.: Tight bounds for online bandwidth allocation on two links. Discret. Appl. Math. 148, 181\u2013188 (2005)","journal-title":"Discret. Appl. Math."},{"key":"163_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00236-010-0124-5","volume":"47","author":"L. Epstein","year":"2010","unstructured":"Epstein L.: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. Acta Inf. 47, 375\u2013389 (2010)","journal-title":"Acta Inf."},{"key":"163_CR8","doi-asserted-by":"crossref","unstructured":"Epstein, L., Kleiman, E., van Stee, R.: Maximizing the minimum load: the cost of selfishness. In: Proceedings of the 5th International Workshop on Internet and Network Economics, Lecture Notes in Computer Science, vol. 5929, pp. 232\u2013243 (2009)","DOI":"10.1007\/978-3-642-10841-9_22"},{"key":"163_CR9","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1137\/100794006","volume":"25","author":"L. Epstein","year":"2011","unstructured":"Epstein L., Levin A., van Stee R.: Max-min online allocations with a recording buffer. SIAM J. Discret. Math. 25, 1230\u20131250 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"163_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ic.2012.01.005","volume":"212","author":"L. Epstein","year":"2012","unstructured":"Epstein L., van Stee R.: The price of anarchy on uniformly related machines revisited. Inf. Comput. 212, 37\u201354 (2012)","journal-title":"Inf. Comput."},{"key":"163_CR11","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Trans. Algorithms 3(32) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"163_CR12","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 2719, pp. 514\u2013526 (2003)","DOI":"10.1007\/3-540-45061-0_42"},{"key":"163_CR13","doi-asserted-by":"crossref","unstructured":"Fiat A., Kaplan H., Levy M., Olonetsky S.: Strong price of anarchy for machine load balancing. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 4596, pp. 583\u2013594 (2007)","DOI":"10.1007\/978-3-540-73420-8_51"},{"key":"163_CR14","doi-asserted-by":"crossref","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 Numer. Math. 19, 312\u2013320 (1979)","journal-title":"BIT Numer. Math."},{"key":"163_CR15","unstructured":"Kleiman, E.: Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective (PhD dissertation), CoRR, abs\/1110.6407 (2011)"},{"key":"163_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias E., Papadimitriou C.H.: Worst-case equilibria. Comput. Sci. Rev. 3, 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"163_CR17","doi-asserted-by":"crossref","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 J. Comput. 19, 52\u201363 (2007)","journal-title":"INFORMS J. Comput."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0163-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-012-0163-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0163-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T17:25:08Z","timestamp":1561915508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-012-0163-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,13]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s00236-012-0163-1","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,13]]}}}