{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:36:26Z","timestamp":1770896186915,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921844","type":"print"},{"value":"9783540921851","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_46","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T11:44:33Z","timestamp":1228909473000},"page":"402-413","source":"Crossref","is-referenced-by-count":19,"title":["Randomized Truthful Mechanisms for Scheduling Unrelated Machines"],"prefix":"10.1007","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[]},{"given":"Changyuan","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/SFCS.2001.959924","volume-title":"FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science","author":"A. Archer","year":"2001","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, Washington, DC, USA, p. 482. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-73420-8_6","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2007","unstructured":"Christodoulou, G., Koutsoupias, E., Kov\u00e1cs, A.: Mechanism design for fractional scheduling on unrelated machines. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 40\u201352. Springer, Heidelberg (2007)"},{"key":"46_CR3","first-page":"38","volume-title":"EC 2008: Proceedings of the 9th ACM conference on Electronic commerce","author":"S. Dobzinski","year":"2008","unstructured":"Dobzinski, S., Sundararajan, M.: On characterizations of truthful mechanisms for combinatorial auctions and scheduling. In: EC 2008: Proceedings of the 9th ACM conference on Electronic commerce, pp. 38\u201347. ACM, New York (2008)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for scheduling on multiple machines. In: Annual IEEE Symposium on Foundations of Computer Science, vol.\u00a00, pp. 254\u2013263 (2005)","DOI":"10.1109\/SFCS.2005.21"},{"key":"46_CR5","unstructured":"Lu, P., Yu, C.: An improved randomized truthful mechanism for scheduling unrelated machines. In: Albers, P., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Dagstuhl, Germany, pp. 527\u2013538. Internationales Begegnungs- und Forschungszentrum f\u201dur Informatik (IBFI), Schloss Dagstuhl, Germany (2008)"},{"key":"46_CR6","first-page":"1143","volume-title":"SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms","author":"A. Mu\u2019alem","year":"2007","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness: extended abstract. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1143\u20131152. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"issue":"1","key":"46_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/301250.301287","volume-title":"STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 129\u2013140. ACM, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:21:15Z","timestamp":1557966075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}