{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:52:33Z","timestamp":1760298753565},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_38","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:20:16Z","timestamp":1372771216000},"page":"449-460","source":"Crossref","is-referenced-by-count":12,"title":["On the Power of Deterministic Mechanisms for Facility Location Games"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"38_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.D., 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":"38_CR2","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s003550100151","volume":"18","author":"S. Barber\u00e0","year":"2001","unstructured":"Barber\u00e0, S.: An introduction to strategyproof social choice functions. Social Choice and Welfare\u00a018, 619\u2013653 (2001)","journal-title":"Social Choice and Welfare"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.geb.2005.08.002","volume":"56","author":"S. Barber\u00e0","year":"2006","unstructured":"Barber\u00e0, S., Bevi\u00e1, C.: Locating public libraries by majority: Stability, consistency and group formation. Games and Economic Behaviour\u00a056, 185\u2013200 (2006)","journal-title":"Games and Economic Behaviour"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proc. of the 13th ACM Conf. on Electronic Commerce (EC\u00a02012), pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"38_CR5","series-title":"LNAI","first-page":"67","volume-title":"ADT\u00a02011","author":"B. Escoffier","year":"2011","unstructured":"Escoffier, B., Gourv\u00e8s, L., Thang, N.K., Pascual, F., Spanjaard, O.: Strategy-proof mechanisms for facility location games with many facilities. In: Brafman, I., Roberts, F., Tsouki\u00e1s, A. (eds.) ADT 2011. LNCS (LNAI), vol.\u00a06992, pp. 67\u201381. Springer, Heidelberg (2011)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, M., Wilf, Y.: Strategyproof Facility Location and the least squares objective. In: Proc. of the 14th ACM Conference on Electronic Commerce, EC\u00a02013 (2013)","DOI":"10.1145\/2492002.2482543"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: Strategyproof Facility Location with concave costs. In: Proc. of the 14th ACM Conference on Electronic Commerce, EC\u00a02013 (2013)","DOI":"10.1145\/2492002.2482595"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2012.11.036","volume":"472","author":"D. Fotakis","year":"2013","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theoretical Computer Science\u00a0472, 90\u2013103 (2013)","journal-title":"Theoretical Computer Science"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.jet.2007.03.006","volume":"138","author":"B.-G. Ju","year":"2008","unstructured":"Ju, B.-G.: Efficiency and consistency for locating multiple public facilities. Journal of Economic Theory\u00a0138, 165\u2013183 (2008)","journal-title":"Journal of Economic Theory"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-24829-0_14","volume-title":"Algorithmic Game Theory","author":"E. Koutsoupias","year":"2011","unstructured":"Koutsoupias, E.: Scheduling without payments. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol.\u00a06982, pp. 143\u2013153. Springer, Heidelberg (2011)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategyproof mechanisms for Two-Facility Games. In: Proc. of the 11th ACM Conf. on Electronic Commerce (EC\u00a02010), pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"38_CR12","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":"38_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s003550000074","volume":"18","author":"E. Miyagawa","year":"2001","unstructured":"Miyagawa, E.: Locating libraries on a street. Social Choice and Welfare\u00a018, 527\u2013541 (2001)","journal-title":"Social Choice and Welfare"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H. Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single-peakedness. Public Choice\u00a035, 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via Differential Privacy. In: Proc. of the 3rd Conference on Innovations in Theoretical Computer Science (ITCS\u00a02012), pp. 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proc. of the 10th ACM Conference on Electronic Commerce (EC\u00a02009), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J. Schummer","year":"2002","unstructured":"Schummer, J., Vohra, R.V.: Strategyproof location on a network. Journal of Economic Theory\u00a0104, 405\u2013428 (2002)","journal-title":"Journal of Economic Theory"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1017\/CBO9780511800481.012","volume":"10","author":"J. Schummer","year":"2007","unstructured":"Schummer, J., Vohra, R.V.: Mechanism design without money. Algorithmic Game Theory\u00a010, 243\u2013299 (2007)","journal-title":"Algorithmic Game Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:34:46Z","timestamp":1557898486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}