{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T02:25:53Z","timestamp":1763259953522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_4","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"31-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Near Optimal Mechanism for Energy Aware Scheduling"],"prefix":"10.1007","author":[{"given":"Antonios","family":"Antoniadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Cristi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2556953","volume":"10","author":"S Albers","year":"2014","unstructured":"Albers, S., Antoniadis, A.: Race to idle: new algorithms for speed scaling with a sleep state. ACM Trans. Algorithms 10(2), 9:1\u20139:31 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"7","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.jcss.2015.03.001","volume":"81","author":"S Albers","year":"2015","unstructured":"Albers, S., Antoniadis, A., Greiner, G.: On multi-processor speed scaling with migration. J. Comput. Syst. Sci. 81(7), 1194\u20131209 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1290672.1290686","volume":"3","author":"S Albers","year":"2007","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4), 49 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-13075-0_20","volume-title":"Algorithms and Computation","author":"E Angel","year":"2014","unstructured":"Angel, E., Bampis, E., Chau, V., Thang, N.K.: Throughput maximization in multiprocessor speed-scaling. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 247\u2013258. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_20"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Huang, C., Ott, S.: A fully polynomial-time approximation scheme for speed scaling with sleep state. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 1102\u20131113. SIAM (2015)","DOI":"10.1137\/1.9781611973730.74"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-70575-8_34","volume-title":"Automata, Languages and Programming","author":"N Bansal","year":"2008","unstructured":"Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for speed bounded processors. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 409\u2013420. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_34"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1206035.1206038","volume":"54","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), 3:1\u20133:39 (2007)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1137\/08072125X","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. SIAM J. Comput. 39(4), 1294\u20131308 (2009)","journal-title":"SIAM J. Comput."},{"key":"4_CR10","unstructured":"Chan, H., Chan, W., Lam, T.W., Lee, L., Mak, K., Wong, P.W.H.: Energy efficient online deadline scheduling. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 795\u2013804. SIAM (2007)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-010-9420-2","volume":"61","author":"H Chan","year":"2011","unstructured":"Chan, H., Edmonds, J., Lam, T.W., Lee, L., Marchetti-Spaccamela, A., Pruhs, K.: Nonclairvoyant speed scaling for flow and energy. Algorithmica 61(3), 507\u2013517 (2011)","journal-title":"Algorithmica"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.dam.2014.08.001","volume":"196","author":"C D\u00fcrr","year":"2015","unstructured":"D\u00fcrr, C., Jez, L., V\u00e1squez, O.C.: Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discrete Appl. Math. 196, 20\u201327 (2015)","journal-title":"Discrete Appl. Math."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2017.07.020","volume":"695","author":"C D\u00fcrr","year":"2017","unstructured":"D\u00fcrr, C., Jez, L., V\u00e1squez, O.C.: Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. Theor. Comput. Sci. 695, 28\u201341 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR14","first-page":"170","volume":"3","author":"IL Glicksberg","year":"1952","unstructured":"Glicksberg, I.L.: A further generalization of the kakutani fixed theorem, with application to nash equilibrium points. Proc. Am. Math. Soc. 3(1), 170 (1952)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63\u201376 (2005)","journal-title":"SIGACT News"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00453-012-9613-y","volume":"65","author":"TW Lam","year":"2013","unstructured":"Lam, T.W., Lee, L., To, I.K., Wong, P.W.H.: Online speed scaling based on active job count to minimize flow plus energy. Algorithmica 65(3), 605\u2013633 (2013)","journal-title":"Algorithmica"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-642-39206-1_63","volume-title":"Automata, Languages, and Programming","author":"N Megow","year":"2013","unstructured":"Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 745\u2013756. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_63"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond moulin mechanisms. In: Proceedings of the 8th ACM Conference on Electronic Commerce, EC 2007, pp. 1\u201310 (2007)","DOI":"10.1145\/1250910.1250912"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: characterization by coalition strategy-proofness. Soc. Choice Welfare 16(2), 279\u2013320 (1999)","journal-title":"Soc. Choice Welfare"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 513\u2013522. ACM, New York (2009)","DOI":"10.1145\/1536414.1536485"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2737816","volume":"3","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. ACM Trans. Econ. Comput. 3(1), 6:1\u20136:20 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"4_CR22","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, 23\u201325 October 1995, pp. 374\u2013382. IEEE Computer Society (1995)"}],"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-319-99660-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:40:19Z","timestamp":1709833219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}