{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:48:23Z","timestamp":1777294103025,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T00:00:00Z","timestamp":1436832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00453-015-0026-6","type":"journal-article","created":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T14:38:42Z","timestamp":1436798322000},"page":"143-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Strategyproof Facility Location for Concave Cost Functions"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6864-8960","authenticated-orcid":false,"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","published-online":{"date-parts":[[2015,7,14]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"crossref","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. Math. Oper. Res. 35(3), 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"key":"26_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907)"},{"key":"26_CR3","doi-asserted-by":"crossref","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. Soc. Choice Welf. 18, 619\u2013653 (2001)","journal-title":"Soc. Choice Welf."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC \u201912), pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Gourv\u00e8s, L., Thang, N.K., Pascual, F., Spanjaard, O.: Strategy-proof mechanisms for facility location games with many facilities. In: Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT \u201911), LNAI 6992, pp. 67\u201381 (2011)","DOI":"10.1007\/978-3-642-24873-3_6"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, M., Wilf, Y.: Strategyproof facility location and the least squares objective. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC\u00a0\u201913)","DOI":"10.1145\/2492002.2482543"},{"issue":"4","key":"26_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2665005","volume":"2","author":"D Fotakis","year":"2014","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. ACM Trans. Econ. Comput. 2(4), 15 (2014). (1\u201337)","journal-title":"ACM Trans. Econ. Comput."},{"key":"26_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 472, 90\u2013103 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E.: Scheduling without payments. In: Proceedings of the 4th International Symposium on Algorithmic Game Theory (SAGT \u201911), Volume 6982 of LNCS, pp. 143\u2013153 (2011)","DOI":"10.1007\/978-3-642-24829-0_14"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce (EC \u201910)","DOI":"10.1145\/1807342.1807393"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Proceedings of the 5th Workshop on Internet and Network Economics (WINE \u201909), LNCS 5929, pp. 137\u2013148 (2009)","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"26_CR12","volume-title":"Discrete Location Theory","author":"PB Mirchandani","year":"1980","unstructured":"Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1980)"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s003550000074","volume":"18","author":"E Miyagawa","year":"2001","unstructured":"Miyagawa, E.: Locating libraries on a street. Soc. Choice Welf. 18, 527\u2013541 (2001)","journal-title":"Soc. Choice Welf."},{"key":"26_CR14","doi-asserted-by":"crossref","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 35, 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via Differential Privacy. In: Proceedings of the 3rd Conference on Innovations in Theoretical Computer Science (ITCS \u201912)","DOI":"10.1145\/2090236.2090254"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM Conference on Electronic Commerce (EC \u201909), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"26_CR18","doi-asserted-by":"crossref","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. J. Econ. Theory 104, 405\u2013428 (2002)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"26_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.2307\/136023","volume":"28","author":"Y Sprumont","year":"1995","unstructured":"Sprumont, Y.: Strategyproof collective choice in economic and political environments. Can. J. Econ. 28(1), 68\u2013108 (1995)","journal-title":"Can. J. Econ."},{"key":"26_CR20","unstructured":"Sui, X., Boutilier, C., Sandholm, T.: Analysis and optimization of multi-dimensional percentile mechanisms. In: Proceedings of the 4th International Workshop on Computational Social Choice (COMSOC \u201912) (2012)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0026-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0026-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0026-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:21Z","timestamp":1559072841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0026-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,14]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["26"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0026-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,14]]}}}