{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:51:21Z","timestamp":1761958281183,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_5","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"30-41","source":"Crossref","is-referenced-by-count":14,"title":["On 2-Player Randomized Mechanisms for Scheduling"],"prefix":"10.1007","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: An Optimal Lower Bound for Anonymous Scheduling. In: Proceedings of EC 2009, pp. 169\u2013176 (2009)","DOI":"10.1145\/1566374.1566399"},{"key":"5_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":"5_CR3","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A lower bound for scheduling mechanisms. In: The Proceedings of SODA 2007, pp. 1163\u20131170 (2007)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-87744-8_25","volume-title":"Algorithms - ESA 2008","author":"G. Christodoulou","year":"2008","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A Characterization of 2-Player Mechanisms for Scheduling. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 297\u2013307. Springer, Heidelberg (2008)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Sundararajan, M.: On Characterizations of Truthful Mechanisms for Combinatorial Auctions and Scheduling. In: Proceedings of EC 2008, pp. 38\u201347 (2008)","DOI":"10.1145\/1386790.1386798"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-74456-6_41","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E. Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Vidali, A.: A Lower Bound of 1\u2009+\u2009\u03c6 for Truthful Scheduling Mechanisms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 454\u2013464. Springer, Heidelberg (2007)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful and Near-Optimal Mechanism Design via Linear Programming. In: Proceedings of FOCS 2005, pp. 595\u2013604 (2005)","DOI":"10.1109\/SFCS.2005.76"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle-monotonicity. In: Proceedings EC 2007, pp. 252\u2013261 (2007)","DOI":"10.1145\/1250910.1250947"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program.\u00a046(3), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Lu, P., Yu, C.: An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. In: Proceedings of STACS 2008, pp. 527\u2013538 (2008)","DOI":"10.1007\/978-3-540-92185-1_46"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-92185-1_46","volume-title":"Internet and Network Economics","author":"P. Lu","year":"2008","unstructured":"Lu, P., Yu, C.: Randomized Truthful Mechanisms for Scheduling Unrelated Machines. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 402\u2013413. Springer, Heidelberg (2008)"},{"key":"5_CR14","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proceedings of SODA 2007, pp. 1143\u20131152 (2007)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proceedings of STOC 1999, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of FOCS 1977, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"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-642-10841-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T20:38:26Z","timestamp":1685219906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}