{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T03:39:53Z","timestamp":1775705993625,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T00:00:00Z","timestamp":1366934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00224-013-9473-0","type":"journal-article","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T21:05:48Z","timestamp":1367355948000},"page":"375-387","source":"Crossref","is-referenced-by-count":20,"title":["Scheduling Without Payments"],"prefix":"10.1007","volume":"54","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,26]]},"reference":[{"issue":"3","key":"9473_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N. Alon","year":"2010","unstructured":"Alon,\u00a0N., Feldman,\u00a0M., Procaccia,\u00a0A., Tennenholtz,\u00a0M.: Strategy proof approximation of the minimax on networks. Math. Oper. Res. 35(3), 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9473_CR2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10951-009-0118-8","volume":"12","author":"E. Angel","year":"2009","unstructured":"Angel,\u00a0E., Bampis,\u00a0E., Pascual,\u00a0F., Tchetgnia,\u00a0A.: On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5), 437\u2013445 (2009)","journal-title":"J. Sched."},{"key":"9473_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/FOCS.2004.68","volume-title":"Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science","author":"E. Anshelevich","year":"2004","unstructured":"Anshelevich,\u00a0E., Dasgupta,\u00a0A., Kleinberg,\u00a0J., Tardos,\u00a0E., Wexler,\u00a0T., Roughgarden,\u00a0T.: The price of stability for network design with fair cost allocation. In: Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science, pp.\u00a0295\u2013304. IEEE Press, New York (2004)"},{"key":"9473_CR4","doi-asserted-by":"crossref","unstructured":"Auletta,\u00a0V., De Prisco,\u00a0R., Penna,\u00a0P., Persiano,\u00a0G.: The power of verification for one-parameter agents. Autom. Lang. Program. 63\u201382 (2004)","DOI":"10.1007\/978-3-540-27836-8_17"},{"key":"9473_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou,\u00a0G., Koutsoupias,\u00a0E., Nanavati,\u00a0A.: Coordination mechanisms. Autom. Lang. Program. 45\u201356 (2004)","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"9473_CR6","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,\u00a0G., Gourves,\u00a0L., Pascual,\u00a0F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: Computing and Combinatorics, pp.\u00a0187\u2013197 (2007)"},{"key":"9473_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou,\u00a0G., Koutsoupias,\u00a0E., Kov\u00e1cs,\u00a0A.: Mechanism design for fractional scheduling on unrelated machines. Autom. Lang. Program. 40\u201352 (2007)","DOI":"10.1007\/978-3-540-73420-8_6"},{"key":"9473_CR8","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,\u00a0S., Ghosh,\u00a0A.: Truthful assignment without money. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp.\u00a0325\u2013334. ACM, New York (2010)"},{"key":"9473_CR9","first-page":"234","volume-title":"WINE","author":"D. Fotakis","year":"2010","unstructured":"Fotakis,\u00a0D., Tzamos,\u00a0C.: Winner-imposing strategy proof mechanisms for multiple facility location games. In: WINE, pp.\u00a0234\u2013245 (2010)"},{"key":"9473_CR10","doi-asserted-by":"crossref","unstructured":"Gibbard,\u00a0A.: Manipulation of voting schemes: a general result. Econometrica 587\u2013601 (1973)","DOI":"10.2307\/1914083"},{"key":"9473_CR11","unstructured":"Guo,\u00a0M., Conitzer,\u00a0V.: 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.\u00a0881\u2013888. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"issue":"2","key":"9473_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,\u00a0E., Papadimitriou, C.H.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009). An earlier version appeared in STACS 1999","journal-title":"Comput. Sci. Rev."},{"key":"9473_CR13","doi-asserted-by":"crossref","unstructured":"Koutsoupias,\u00a0E., Vidali,\u00a0A.: A\u00a0lower bound of 1+\u03c6 for truthful scheduling mechanisms. Mat. Found. Comput. Sci. 454\u2013464 (2007)","DOI":"10.1007\/978-3-540-74456-6_41"},{"key":"9473_CR14","first-page":"137","volume-title":"WINE","author":"P. Lu","year":"2009","unstructured":"Lu,\u00a0P., Wang,\u00a0Y., Zhou,\u00a0Y.: Tighter bounds for facility games. In: WINE, pp.\u00a0137\u2013148 (2009)"},{"key":"9473_CR15","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,\u00a0P., Sun,\u00a0X., Wang,\u00a0Y., Zhu,\u00a0Z.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp.\u00a0315\u2013324. ACM, New York (2010)"},{"key":"9473_CR16","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,\u00a0A., Schapira,\u00a0M.: Setting lower bounds on truthfulness: extended abstract. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a01143\u20131152. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"9473_CR17","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,\u00a0N., Ronen,\u00a0A.: Algorithmic mechanism design (extended abstract). In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp.\u00a0129\u2013140. ACM, New York (1999)"},{"key":"9473_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan,\u00a0N., Roughgarden,\u00a0T., Tardos,\u00a0E., Vazirani,\u00a0V.: Algorithmic Game Theory. Cambridge Univ. Press, Cambridge (2007)"},{"key":"9473_CR19","unstructured":"Nissim,\u00a0K., Smorodinsky,\u00a0R., Tennenholtz,\u00a0M.: Approximately optimal mechanism design via differential privacy (2010). arXiv:1004.2888"},{"key":"9473_CR20","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1007\/978-3-540-87744-8_59","volume-title":"Algorithms-ESA 2008","author":"P. Penna","year":"2008","unstructured":"Penna,\u00a0P., Ventre,\u00a0C.: Collusion-resistant mechanisms with verification yielding optimal solutions. In: Algorithms-ESA 2008, pp.\u00a0708\u2013719 (2008)"},{"key":"9473_CR21","doi-asserted-by":"crossref","unstructured":"Penna,\u00a0P., Ventre,\u00a0C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. (2012)","DOI":"10.1016\/j.geb.2012.09.002"},{"key":"9473_CR22","doi-asserted-by":"crossref","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,\u00a0A., Tennenholtz,\u00a0M.: Approximate mechanism design without money. In: Proceedings of the Tenth ACM Conference on Electronic Commerce, pp.\u00a0177\u2013186. ACM, New York (2009)"},{"key":"9473_CR23","first-page":"321","volume-title":"Aggregation and Revelation of Preferences","author":"K. Roberts","year":"1979","unstructured":"Roberts,\u00a0K.: The characterization of implementable choice rules. In: Aggregation and Revelation of Preferences, pp.\u00a0321\u2013348 (1979)"},{"issue":"2","key":"9473_CR24","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M. Satterthwaite","year":"1975","unstructured":"Satterthwaite,\u00a0M.: 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":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9473-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9473-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9473-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T15:27:25Z","timestamp":1644938845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9473-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,26]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9473"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9473-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,26]]}}}