{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:47:42Z","timestamp":1725515262350},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_436","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"970-973","source":"Crossref","is-referenced-by-count":0,"title":["Truthful Mechanisms for One-Parameter Agents"],"prefix":"10.1007","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"436_CR1_436","doi-asserted-by":"crossref","unstructured":"Ambrosio, P., Auletta, V.: Deterministic monotone algorithms for scheduling on related machines. In: 2nd Ws. on Approx. and Online Alg. (WAOA), 2004, pp.\u00a0267\u2013280","DOI":"10.1007\/978-3-540-31833-0_22"},{"key":"436_CR2_436","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: 22nd Ann. Symp. on Theor. Aspects of Comp. Sci. (STACS), 2005, pp.\u00a069\u201382","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"436_CR3_436","unstructured":"Archer, A.: Mechanisms for Discrete Optimization with Rational Agents. Ph.\u202fD. thesis, Cornell University (2004)"},{"key":"436_CR4_436","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one\u2010parameter agents. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS), 2001, pp.\u00a0482\u2013491","DOI":"10.1109\/SFCS.2001.959924"},{"key":"436_CR5_436","doi-asserted-by":"crossref","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. In: 21st Ann. Symp. on Theor. Aspects of Comp. Sci. (STACS), 2004, pp.\u00a0608\u2013619","DOI":"10.1007\/978-3-540-24749-4_53"},{"key":"436_CR6_436","doi-asserted-by":"crossref","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G., Ventre, C.: New constructions of mechanisms with verification. In: 33rd International Colloquium on Automata, Languages and Programming (ICALP) (1), 2006, pp.\u00a0596\u2013607","DOI":"10.1007\/11786986_52"},{"issue":"3","key":"436_CR7_436","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: A\u00a0polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J.\u00a0Comput. 17(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"436_CR8_436","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.orl.2006.01.005","volume":"35","author":"T. Kis","year":"2006","unstructured":"Kis, T., Kapolnai, R.: Approximations and auctions for scheduling batches on related machines. Operat. Res. Let. 35(1), 61\u201368 (2006)","journal-title":"Operat. Res. Let."},{"key":"436_CR9_436","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A.: Fast monotone 3\u2011approximation algorithm for scheduling related machines. In: 13th Annual European Symposium (ESA), 2005, pp.\u00a0616\u2013627","DOI":"10.1007\/11561071_55"},{"key":"436_CR10_436","unstructured":"Kov\u00e1cs, A.: Fast Algorithms for Two Scheduling Problems. Ph.\u202fD. thesis, Universit\u00e4t des Saarlandes (2007)"},{"key":"436_CR11_436","unstructured":"Mu'alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: SODA, 2007"},{"key":"436_CR12_436","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Game. Econ. Behav. 35, 166\u2013196 (2001)","journal-title":"Game. Econ. Behav."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:55:29Z","timestamp":1662170129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_436"}},"subtitle":["2001; Archer, Tardos"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_436","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}