{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:28:38Z","timestamp":1745386118971},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_2","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"15-26","source":"Crossref","is-referenced-by-count":4,"title":["Truthfulness for the Sum of Weighted Completion Times"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanny","family":"Pascual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Thibault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-44777-2_2","volume-title":"Algorithms - ESA 2014","author":"F Abed","year":"2014","unstructured":"Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 13\u201324. Springer, Heidelberg (2014)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-540-31833-0_22","volume-title":"Approximation and Online Algorithms","author":"P Ambrosio","year":"2005","unstructured":"Ambrosio, P., Auletta, V.: Deterministic monotone algorithms for scheduling on related machines. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 267\u2013280. Springer, Heidelberg (2005)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-31856-9_6","volume-title":"STACS 2005","author":"N Andelman","year":"2005","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 69\u201382. Springer, Heidelberg (2005)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E Angel","year":"2006","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. Theoret. Comput. Sci. 369, 157\u2013168 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10951-009-0118-8","volume":"12","author":"E Angel","year":"2009","unstructured":"Angel, E., Bampis, E., Pascual, F., Tchetgnia, A.: On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12, 437\u2013445 (2009)","journal-title":"J. Sched."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2011.10.006","volume":"414","author":"E Angel","year":"2012","unstructured":"Angel, E., Bampis, E., Thibault, N.: Randomized truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 414(1), 1\u20138 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, M., Chen, J., Kannan, S.: Optimal provision-after-wait in healthcare. In: ITCS 2014, Princeton, NJ, pp. 541\u2013542 (2014)","DOI":"10.1145\/2554797.2554846"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 187\u2013197. Springer, Heidelberg (2007)"},{"issue":"1","key":"2_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-662-48096-0_15","volume-title":"Euro-Par 2015: Parallel Processing","author":"J Cohen","year":"2015","unstructured":"Cohen, J., Pascual, F.: Scheduling tasks from selfish multi-tasks agents. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 183\u2013195. Springer, Heidelberg (2015)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V.S., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: ACM STOC 2011, pp. 539\u2013548 (2011)","DOI":"10.1145\/1993636.1993708"},{"key":"2_CR13","unstructured":"Fotakis, D., Tzamos, C., Zampetakis, E.: Who to trust for truthfully maximizing welfare? CoRR abs\/1507.02301 (2015)"},{"issue":"4","key":"2_CR14","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentive in teams. Econometrica 41(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-642-29116-6_22","volume-title":"Approximation and Online Algorithms","author":"R Hoeksma","year":"2012","unstructured":"Hoeksma, R., Uetz, M.: The price of anarchy for minsum related machine scheduling. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 261\u2013273. Springer, Heidelberg (2012)"},{"issue":"2","key":"2_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.healthpol.2004.07.003","volume":"72","author":"J Hurst","year":"2005","unstructured":"Hurst, J., Siciliani, L.: Tackling excessive waiting times for elective surgery: a comparison of policies in 12 OECD countries. Health Policy 72(2), 201\u2013215 (2005)","journal-title":"Health Policy"},{"issue":"4","key":"2_CR17","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119\u20131129 (1986)","journal-title":"SIAM J. Comput."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, p. 404. Springer, Heidelberg (1999)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"issue":"4","key":"2_CR20","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"AS Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM J. Discret. Math. 15(4), 450\u2013469 (2002)","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single stage production. Naval Res. Logist. Q. 3, 59\u201366 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. J. Financ. 16, 8\u201337 (1961)","journal-title":"J. Financ."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:02:54Z","timestamp":1568185374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}