{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:43Z","timestamp":1725892603365},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_3","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"6-7","source":"Crossref","is-referenced-by-count":0,"title":["Recent Developments in the Mechanism Design Problem for Scheduling"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: An optimal lower bound for anonymous scheduling mechanisms. In: Proceedings of the Tenth ACM Conference on Electronic Commerce, pp. 169\u2013176 (2009)","DOI":"10.1145\/1566374.1566399"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Kov\u00e1cs, A.: Mechanism design for fractional scheduling on unrelated machines. ACM Transactions on Algorithms\u00a06(2) (2010)","DOI":"10.1145\/1721837.1721854"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s00453-008-9165-3","volume":"55","author":"G. Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A Lower Bound for Scheduling Mechanisms. Algorithmica\u00a055(4), 729\u2013740 (2009)","journal-title":"Algorithmica"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of 1+\u03c6 for truthful scheduling mechanisms. In: Mathematical Foundations of Computer Science (MFCS), Krumlov, Czech Republic, August 26-31, pp. 454\u2013464 (2007)","DOI":"10.1007\/978-3-540-74456-6_41"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. In: ACM Conference on Electronic Commerce, EC (2007)","DOI":"10.1145\/1250910.1250947"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC), pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T04:10:41Z","timestamp":1560226241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}