{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:12Z","timestamp":1725617412612},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"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-24829-0_14","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"143-153","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling without Payments"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N. Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Mathematics of Operations Research\u00a035(3), 513\u2013526 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-27836-8_17","volume-title":"Automata, Languages and Programming","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"14_CR3","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":"14_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/1807342.1807394","volume-title":"Proceedings of the 11th ACM Conference on Electronic Commerce","author":"S. Dughmi","year":"2010","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 325\u2013334. ACM, New York (2010)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-17572-5_19","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing strategyproof mechanisms for multiple facility location games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 234\u2013245. Springer, Heidelberg (2010)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica: Journal of the Econometric Society, 587\u2013601 (1973)","DOI":"10.2307\/1914083"},{"key":"14_CR7","unstructured":"Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol.\u00a01, pp. 881\u2013888. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"key":"14_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+ \u03d5 for truthful scheduling mechanisms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 454\u2013464. Springer, Heidelberg (2007)"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/1807342.1807393","volume-title":"Proceedings of the 11th ACM Conference on Electronic Commerce","author":"P. Lu","year":"2010","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 315\u2013324. ACM, New York (2010)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-10841-9_14","volume-title":"Internet and Network Economics","author":"P. Lu","year":"2009","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 137\u2013148. Springer, Heidelberg (2009)"},{"key":"14_CR11","first-page":"1143","volume-title":"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: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1143\u20131152. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/301250.301287","volume-title":"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: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 129\u2013140. ACM, New York (1999)"},{"key":"14_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic game theory. Cambridge Univ. Pr., Cambridge (2007)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. Arxiv preprint arXiv:1004.2888 (2010)","DOI":"10.2139\/ssrn.2017224"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/1566374.1566401","volume-title":"Proceedings of the Tenth ACM Conference on Electronic Commerce","author":"A. Procaccia","year":"2009","unstructured":"Procaccia, A., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the Tenth ACM Conference on Electronic Commerce, pp. 177\u2013186. ACM, New York (2009)"},{"key":"14_CR16","unstructured":"Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321\u2013348 (1979)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M. Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategy-proofness and Arrow\u2019s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory\u00a010(2), 187\u2013217 (1975)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T18:10:16Z","timestamp":1638987016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}