{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T00:42:58Z","timestamp":1769388178578,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T00:00:00Z","timestamp":1489968000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC Advanced Grant 321171 (ALGAME)"],"award-info":[{"award-number":["ERC Advanced Grant 321171 (ALGAME)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007398","name":"Strategiske Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["Center for Research in Foundations of Electronic Markets (CFEM)"],"award-info":[{"award-number":["Center for Research in Foundations of Electronic Markets (CFEM)"]}],"id":[{"id":"10.13039\/100007398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008367","name":"Statens Naturvidenskabelige Forskningsrad","doi-asserted-by":"publisher","award":["61061130540"],"award-info":[{"award-number":["61061130540"]}],"id":[{"id":"10.13039\/100008367","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61361136003"],"award-info":[{"award-number":["61361136003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["CityU 117913"],"award-info":[{"award-number":["CityU 117913"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["FET Proactive IP Project number 317532"],"award-info":[{"award-number":["FET Proactive IP Project number 317532"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10458-017-9361-0","type":"journal-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T05:46:11Z","timestamp":1489988771000},"page":"1209-1235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Facility location with double-peaked preferences"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7868-8114","authenticated-orcid":false,"given":"Aris","family":"Filos-Ratsikas","sequence":"first","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,20]]},"reference":[{"issue":"3","key":"9361_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. (2010). Strategyproof approximation of the minimax on networks. Mathematics of Operations Research, 35(3), 513\u2013526.","journal-title":"Mathematics of Operations Research"},{"key":"9361_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Fischer, F., Kash, I., & Procaccia, A. D. (2010). Mix and match. In Proceedings of the 11th ACM conference on Electronic commerce (ACM-EC) (pp. 305\u2013314). ACM.","DOI":"10.1145\/1807342.1807392"},{"issue":"4","key":"9361_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J Bartholdi","year":"1986","unstructured":"Bartholdi, J., & Trick, M. A. (1986). Stable matching with preferences derived from a psychological model. Operations Research Letters, 5(4), 165\u2013169.","journal-title":"Operations Research Letters"},{"key":"9361_CR4","volume-title":"The theory of committees and elections","author":"D Black","year":"1957","unstructured":"Black, D. (1957). The theory of committees and elections. Dordrecht: Kluwer Academic Publishers. (reprint at 1986)."},{"key":"9361_CR5","unstructured":"Cai, Q., Filos-Ratsikas, A., Filos, A., & Tang, P. (2016). Facility location with minimax envy. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 137\u2013143)."},{"key":"9361_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Filos-Ratsikas, A., & Procaccia, A. D. (2011). An improved 2-agent kidney exchange mechanism. In Proceedings of the 7th Workshop of Internet and Network Economics (WINE) (pp. 37\u201348). Springer.","DOI":"10.1007\/978-3-642-25510-6_4"},{"key":"9361_CR7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.tcs.2011.11.041","volume":"497","author":"Y Cheng","year":"2013","unstructured":"Cheng, Y., Wei, Y., & Zhang, G. (2013). Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoretical Computer Science, 497, 154\u2013163.","journal-title":"Theoretical Computer Science"},{"key":"9361_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Yu, W., & Zhang, G. (2011). Mechanisms for obnoxious facility game on a path. In International Conference on Combinatorial Optimization and Applications (pp. 262\u2013271). Springer.","DOI":"10.1007\/978-3-642-22616-8_21"},{"key":"9361_CR9","doi-asserted-by":"crossref","unstructured":"Conitzer, V. (2007). Eliciting single-peaked preferences using comparison queries. In Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems (p. 65). ACM.","DOI":"10.1145\/1329125.1329204"},{"key":"9361_CR10","volume-title":"The strategic constitution","author":"RD Cooter","year":"2002","unstructured":"Cooter, R. D. (2002). The strategic constitution. Princeton: Princeton University Press."},{"key":"9361_CR11","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., & Nehama, I. (2012). Mechanism design on discrete lines and cycles. In Proceedings of the 13th ACM Conference on Electronic Commerce (ACM-EC) (pp. 423\u2013440).","DOI":"10.1145\/2229012.2229045"},{"key":"9361_CR12","doi-asserted-by":"crossref","unstructured":"Dughmi, S., & Gosh, A. (2010). Truthful assignment without money. In Proceedings of the 11th ACM conference on Electronic commerce (ACM-EC) (pp. 325\u2013334).","DOI":"10.1145\/1807342.1807394"},{"issue":"2","key":"9361_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1017\/S0022381613001527","volume":"76","author":"PJ Egan","year":"2013","unstructured":"Egan, P. J. (2013). \u201cDo something\u201d politics and double-peaked policy preferences. Journal of Politics, 76(2), 333\u2013349.","journal-title":"Journal of Politics"},{"key":"9361_CR14","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Gourv\u00e8s, L., Thang, N. K., Pascual, F., & Spanjaard, O. (2011). Strategy-proof mechanisms for facility location games with many facilities. In The 2nd International Conference on Algorithmic Decision Theory, (pp. 67\u201381). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-24873-3_6"},{"key":"9361_CR15","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., & \u00d6zt\u00fcrk, M. (2008). Single-peaked consistency and its complexity. In The 18th European Conference on Artificial Intelligence (ECAI), 8, (pp. 366\u2013370).","DOI":"10.3233\/978-1-58603-891-5-366"},{"key":"9361_CR16","unstructured":"Feigenbaum, I., & Sethuraman, J. (2014). Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location. arXiv preprint arXiv:1412.3414 ."},{"key":"9361_CR17","unstructured":"Feigenbaum, I., Sethuraman, J., & Ye, C. (2013). Approximately optimal mechanisms for strategyproof facility location: Minimizing $$l_p $$ l p norm of costs. arXiv preprint arXiv:1305.2446 ."},{"key":"9361_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, M., & Wilf, Y. (2013). Strategyproof facility location and the least squares objective. In Proceedings of the 14th ACM conference on Electronic Commerce (ACM-EC) (pp. 873\u2013890).","DOI":"10.1145\/2492002.2482543"},{"key":"9361_CR19","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., & Miltersen, P. B. (2014). Truthful approximations to range voting. In International Conference on Web and Internet Economics (pp. 175\u2013188). Springer.","DOI":"10.1007\/978-3-319-13129-0_13"},{"key":"9361_CR20","doi-asserted-by":"crossref","unstructured":"Fotakis, D., & Tzamos, C. (2010). Winner-imposing strategyproof mechanisms for multiple facility location games. In Proceeding of the 5th International Workshop of Internet and Network Economics (WINE) (pp. 234\u2013245).","DOI":"10.1007\/978-3-642-17572-5_19"},{"key":"9361_CR21","unstructured":"Fotakis, D., Tzamos, C., & Zampetakis, E. (2015). Who to trust for truthfully maximizing welfare? arXiv preprint arXiv:1507.02301 ."},{"key":"9361_CR22","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. (2013). Winner-imposing strategyproof mechanisms for multiple facility location games. Theoretical Computer Science, 472, 90\u2013103.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9361_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2665005","volume":"2","author":"D Fotakis","year":"2014","unstructured":"Fotakis, D., & Tzamos, C. (2014). On the power of deterministic mechanisms for facility location games. ACM Transactions on Economics and Computation, 2(4), 15.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9361_CR24","unstructured":"Guo, M., & Conitzer, V. (2010). Strategy-proof allocation of multiple items between two agents without payments or priors. In Ninth International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS), Vol. 10, pp. 881\u2013888."},{"key":"9361_CR25","doi-asserted-by":"crossref","first-page":"525","DOI":"10.2307\/1910176","volume":"8","author":"KI Inada","year":"1964","unstructured":"Inada, K. I. (1964). A note on the simple majority decision rule. Econometrica: Journal of the Econometric Society, 8, 525\u2013531.","journal-title":"Econometrica: Journal of the Econometric Society"},{"key":"9361_CR26","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., & Zhu, Z. A. (2010). Asymptotically optimal strategy-proof mechanisms for two-facility games. In Proceedings of the 11th ACM Conference on Electronic Commerce (ACM-EC) (pp. 315\u2013324).","DOI":"10.1145\/1807342.1807393"},{"key":"9361_CR27","doi-asserted-by":"crossref","unstructured":"Lu, P., Wang, Y., & Zhou, Y. (2009). Tighter bounds for facility games. In Proceeding of the 5th International Workshop of Internet and Network Economics (WINE), (pp. 137\u2013148).","DOI":"10.1007\/978-3-642-10841-9_14"},{"issue":"4","key":"9361_CR28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H. (1980). On strategy-proofness and single peakedness. Public Choice, 35(4), 437\u2013455.","journal-title":"Public Choice"},{"key":"9361_CR29","unstructured":"Procaccia, A. D., Wajc, D., & Zhang, H. (2016). Approximation-Variance Tradeoffs in Mechanism Design. working paper."},{"issue":"4","key":"9361_CR30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A. D., & Tennenholtz, M. (2013). Approximate mechanism design without money. ACM Transactions on Economics and Computation, 1(4), 18.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9361_CR31","unstructured":"Rosen, H. S. (2005). Public Finance (7th ed.). McGraw-Hill Irwin."},{"issue":"2","key":"9361_CR32","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. (2002). Strategy-proof location on a network. Journal of Economic Theory, 104(2), 405\u2013428.","journal-title":"Journal of Economic Theory"},{"key":"9361_CR33","doi-asserted-by":"crossref","unstructured":"Serafino, P., & Ventre, C. (2015). Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In AAAI (pp. 1029\u20131035).","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"9361_CR34","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2016.04.033","volume":"636","author":"P Serafino","year":"2016","unstructured":"Serafino, P., & Ventre, C. (2016). Heterogeneous facility location without money. Theoretical Computer Science, 636, 27\u201346.","journal-title":"Theoretical Computer Science"},{"key":"9361_CR35","doi-asserted-by":"crossref","unstructured":"Sonoda, A., Todo, T., & Yokoo, M. (2016). False-name-proof locations of two facilities: Economic and algorithmic approaches. In Proceedings of the 30th AAAI Conference on Artificial Intelligence, (pp. 615\u2013621). AAAI Press.","DOI":"10.1609\/aaai.v30i1.10029"},{"key":"9361_CR36","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.jmateco.2014.09.007","volume":"55","author":"L-G Svensson","year":"2014","unstructured":"Svensson, L.-G., & Reffgen, A. (2014). The proof of the Gibbard\u2013Satterthwaite theorem revisited. Journal of Mathematical Economics, 55, 11\u201314.","journal-title":"Journal of Mathematical Economics"},{"key":"9361_CR37","unstructured":"Todo, T., Iwasaki, A., & Yokoo, M. (2011). False-name-proof mechanism design without money. In The 10th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, (pp. 651\u2013658). International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"9361_CR38","unstructured":"Yang, Y., & Guo, J. (2015). How hard is control in multi-peaked elections: A parameterized study. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, (pp. 1729\u20131730). International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"9361_CR39","unstructured":"Zou, S., & Li, M. (2015). Facility location games with dual preference. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, (pp. 615\u2013623). International Foundation for Autonomous Agents and Multiagent Systems."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-017-9361-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-017-9361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-017-9361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:38:35Z","timestamp":1750135115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-017-9361-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,20]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["9361"],"URL":"https:\/\/doi.org\/10.1007\/s10458-017-9361-0","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,20]]}}}