{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:07Z","timestamp":1759637587449},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_24","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"302-314","source":"Crossref","is-referenced-by-count":1,"title":["The Anarchy of Scheduling Without Money"],"prefix":"10.1007","author":[{"given":"Yiannis","family":"Giannakopoulos","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10951-009-0118-8","volume":"12","author":"E Angel","year":"2009","unstructured":"Angel, E., Bampis, E., Pascual, F., Tchetgnia, A.-A.: On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5), 437\u2013445 (2009)","journal-title":"J. Sched."},{"issue":"2","key":"24_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.1110.0534","volume":"37","author":"I Ashlagi","year":"2012","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: Optimal lower bounds for anonymous scheduling mechanisms. Math. Oper. Res. 37(2), 244\u2013258 (2012)","journal-title":"Math. Oper. Res."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3142, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 187\u2013197. Springer, Heidelberg (2007)"},{"issue":"2","key":"24_CR5","doi-asserted-by":"crossref","first-page":"38: 1","DOI":"10.1145\/1721837.1721854","volume":"6","author":"G Christodoulou","year":"2010","unstructured":"Christodoulou, G., Koutsoupias, E., Kov\u00e1cs, A.: Mechanism design for fractional scheduling on unrelated machines. ACM Trans. Algorithms 6(2), 38: 1\u201338: 18 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: EC, pp. 325\u2013334 (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6484, pp. 234\u2013245. Springer, Heidelberg (2010)"},{"key":"24_CR8","unstructured":"Giannakopoulos, Y., Koutsoupias, E., Kyropoulou, M.: The anarchy of scheduling without money. CoRR, abs\/1607.03688 (2016). http:\/\/arxiv.org\/abs\/1607.03688"},{"issue":"4","key":"24_CR9","doi-asserted-by":"crossref","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"24_CR10","unstructured":"Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: AAMAS, pp. 881\u2013888 (2010)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00224-013-9473-0","volume":"54","author":"E Koutsoupias","year":"2014","unstructured":"Koutsoupias, E.: Scheduling without payments. Theory Comput. Syst. 54(3), 375\u2013387 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"24_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"24_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00453-012-9634-6","volume":"66","author":"E Koutsoupias","year":"2013","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of 1+ $$\\varphi $$ for truthful scheduling mechanisms. Algorithmica 66(1), 211\u2013223 (2013)","journal-title":"Algorithmica"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Levin, H., Schapira, M., Zohar, A.: Interdomain routing and games. In: STOC, pp. 57\u201366 (2008)","DOI":"10.1145\/1374376.1374388"},{"key":"24_CR15","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness: extended abstract. In: SODA, pp. 1143\u20131152 (2007)"},{"issue":"1\/2","key":"24_CR16","doi-asserted-by":"crossref","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 Econ. Behav. 35(1\/2), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"24_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: ITCS, pp. 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.geb.2012.09.002","volume":"86","author":"P Penna","year":"2014","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491\u2013509 (2014)","journal-title":"Games Econ. Behav."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: EC, pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"24_CR21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. 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-662-53354-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:59:49Z","timestamp":1498327189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}