{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:36:27Z","timestamp":1770896187252,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540877431","type":"print"},{"value":"9783540877448","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_25","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"297-307","source":"Crossref","is-referenced-by-count":19,"title":["A Characterization of 2-Player Mechanisms for Scheduling"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Angelina","family":"Vidali","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: STACS, pp. 69\u201382 (2005)","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"25_CR2","unstructured":"Archer, A.: Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University (January 2004)"},{"key":"25_CR3","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, \u00c9.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: SODA, pp. 205\u2013214 (2003)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"25_CR5","unstructured":"Archer, A., Tardos, \u00c9.: Frugal path mechanisms. In: SODA (2002)"},{"key":"25_CR6","unstructured":"Babaioff, M., Lavi, R., Pavlov, E.: Mechanism design for single-value domains. In: AAAI, pp. 241\u2013247 (2005)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: TARK, pp. 72\u201387 (2003)","DOI":"10.1145\/846241.846250"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: STOC, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"25_CR9","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":"25_CR10","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A lower bound for scheduling mechanisms. In: SODA, pp. 1163\u20131169 (2007)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"8","author":"E. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice\u00a08, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC, pp. 610\u2013618 (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. In: STOC, pp. 644\u2013652 (2006)","DOI":"10.1145\/1132516.1132607"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Sundararajan, M.: On characterizations of truthful mechanisms for combinatorial auctions and scheduling. In: EC (2008)","DOI":"10.1145\/1386790.1386798"},{"key":"25_CR15","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":"25_CR16","unstructured":"Kevin, R.: The characterization of implementable choice rules. In: Aggregation and Revelation of Preferences, pp. 321\u2013348 (1979)"},{"key":"25_CR17","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+\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":"25_CR18","unstructured":"Kov\u00e1cs, A.: Fast Algorithms for Two Scheduling Problems. PhD thesis, Universit\u00e4t des Saarlandes (2007)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Lavi, R., Mu\u2019alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: FOCS, pp. 574\u2013583 (2003)","DOI":"10.1109\/SFCS.2003.1238230"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. In: EC, pp. 252\u2013261 (2007)","DOI":"10.1145\/1250910.1250947"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Lu, P., Yu, C.: An improved randomized truthful mechanism for scheduling unrelated machines. In: STACS, pp. 527\u2013538 (2008)","DOI":"10.1007\/978-3-540-92185-1_46"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Monderer, D.: Monotonicity and implementability. In: EC (2008)","DOI":"10.1145\/1386790.1386799"},{"key":"25_CR23","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: SODA, pp. 1143\u20131152 (2007)"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR25","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. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Saks, M.E., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings 6th ACM Conference on Electronic Commerce (EC), pp. 286\u2013293 (2005)","DOI":"10.1145\/1064009.1064040"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculations, auctions and competitive sealed tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:05:35Z","timestamp":1738350335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}