{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:36Z","timestamp":1725617436356},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_16","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"166-177","source":"Crossref","is-referenced-by-count":3,"title":["Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Fleischer","sequence":"first","affiliation":[]},{"given":"Zhenghui","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp. 69\u201382 (2005)","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"16_CR2","unstructured":"Archer, A.: Mechanisms for discrete optimization with rational agents. PhD thesis, Ithaca, NY, USA (2004)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: An optimal lower bound for anonymous scheduling mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 169\u2013176 (2009)","DOI":"10.1145\/1566374.1566399"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Kov\u00e1cs, A.: A deterministic truthful PTAS for scheduling related machines. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1005\u20131016 (2010)","DOI":"10.1137\/1.9781611973075.81"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Feldman, M., Fiat, A., Kaplan, H., Olonetsky, S.: Envy-free makespan approximation: extended abstract. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 159\u2013166 (2010)","DOI":"10.1145\/1807342.1807368"},{"key":"16_CR7","unstructured":"Cohen, E., Feldman, M., Fiat, A., Kaplan, H., Olonetsky, S.: On the interplay between incentive compatibility and envy freeness (2010), http:\/\/arxiv.org\/abs\/1003.5328"},{"key":"16_CR8","unstructured":"Cohen, E., Feldman, M., Fiat, A., Kaplan, H., Olonetsky, S.: Truth and envy in capacitated allocation games (2010), http:\/\/arxiv.org\/abs\/1003.5326"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. In: Proceedings of 49th Annual Symposium on Foundations of Computer Science, pp. 15\u201324 (2008)","DOI":"10.1109\/FOCS.2008.71"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"L. Dubins","year":"1961","unstructured":"Dubins, L., Spanier, E.: How to cut a cake fairly. American Mathematical Monthly\u00a068, 1\u201317 (1961)","journal-title":"American Mathematical Monthly"},{"key":"16_CR11","first-page":"45","volume":"7","author":"D. Foley","year":"1967","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Economic Essays\u00a07, 45\u201398 (1967)","journal-title":"Yale Economic Essays"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017, 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/11561071_55","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kov\u00e1cs","year":"2005","unstructured":"Kov\u00e1cs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 616\u2013627. Springer, Heidelberg (2005)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.jda.2008.11.004","volume":"7","author":"A. Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs, A.: Tighter approximation bounds for LPT scheduling in two special cases. J. of Discrete Algorithms\u00a07, 327\u2013340 (2009)","journal-title":"J. of Discrete Algorithms"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Mu\u2019Alem, A.: On multi-dimensional envy-free mechanisms. In: Proceedings of the 1st International Conference on Algorithmic Decision Theory, pp. 120\u2013131 (2009)","DOI":"10.1007\/978-3-642-04428-1_11"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:57:13Z","timestamp":1560729433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}