{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:08Z","timestamp":1725795128747},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_17","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"182-193","source":"Crossref","is-referenced-by-count":1,"title":["The PoA of Scheduling Game with Machine Activation Costs"],"prefix":"10.1007","author":[{"given":"Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujie","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.jda.2005.06.009","volume":"4","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Goldberg, L., Goldberg, P., Martin, R.: Utilitarian resource assignment. Journal of Discrete Algorithm\u00a04, 567\u2013587 (2006)","journal-title":"Journal of Discrete Algorithm"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10951-011-0247-8","volume":"15","author":"B. Chen","year":"2012","unstructured":"Chen, B., G\u00fcrel, S.: Resource allocation games of utilitarian social objectives. Journal of Scheduling\u00a015, 157\u2013164 (2012)","journal-title":"Journal of Scheduling"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(4) (2007)","DOI":"10.1145\/1219944.1219949"},{"key":"17_CR4","doi-asserted-by":"publisher","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 Informatica\u00a047, 375\u2013389 (2010)","journal-title":"Acta Informatica"},{"key":"17_CR5","doi-asserted-by":"publisher","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. Information and Computation\u00a0212, 37\u201354 (2012)","journal-title":"Information and Computation"},{"key":"17_CR6","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":"17_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M. Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. Operations Research\u00a060, 529\u2013540 (2012)","journal-title":"Operations Research"},{"key":"17_CR8","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0410, 3305\u20133326 (2009)","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","doi-asserted-by":"publisher","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. Computer Science Review\u00a03, 65\u201369 (2009)","journal-title":"Computer Science Review"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:29:05Z","timestamp":1558913345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}