{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T04:41:32Z","timestamp":1667104892959},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T00:00:00Z","timestamp":1655510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T00:00:00Z","timestamp":1655510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE23- 0018"],"id":[{"id":"10.13039\/501100001665","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":[[2022,10]]},"DOI":"10.1007\/s10458-022-09567-5","type":"journal-article","created":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T07:10:52Z","timestamp":1655536252000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the distortion of single winner elections with aligned candidates"],"prefix":"10.1007","volume":"36","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5076-1583","authenticated-orcid":false,"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"9567_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A., (2020). Peeking behind the ordinal curtain: Improving distortion via cardinal queries. In Proceedings of the 34th AAAI conference on artificial intelligence, pages 1782\u20131789.","DOI":"10.1609\/aaai.v34i02.5544"},{"key":"9567_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.artint.2018.07.006","volume":"264","author":"E Anshelevich","year":"2018","unstructured":"Anshelevich, E., Bhardwaj, O., Elkind, E., Postl, J., & Piotr, S., (2018). Approximating optimal social choice under metric preferences. Artificial Intelligence, 264, 27\u201351.","journal-title":"Artificial Intelligence"},{"key":"9567_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Bhardwaj, O., & Postl. J., (2015). Approximating optimal social choice under metric preferences. In Proceedings of the 29th AAAI conference on artificial intelligence, pages 777\u2013783.","DOI":"10.1609\/aaai.v29i1.9308"},{"key":"9567_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Filos-Ratsikas, A., Shah, N., & Voudouris, A. A., (2021). Distortion in social choice problems: The first 15 years and beyond. In Proceedings of the 30th international joint conference on artificial intelligence, IJCAI 2021, Virtual Event \/ Montreal, Canada, 19-27 August 2021, pages 4294\u20134301.","DOI":"10.24963\/ijcai.2021\/589"},{"key":"9567_CR5","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1613\/jair.5340","volume":"58","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., & John, P., (2017). Randomized social choice functions under metric preferences. Journal of Artificial Intelligence Research, 58, 797\u2013827.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9567_CR6","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Zhu, W., (2018). Ordinal approximation for social choice, matching, and facility location problems given candidate positions. In Web and Internet Economics - 14th International conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings, pages 3\u201320.","DOI":"10.1007\/978-3-030-04612-5_1"},{"issue":"4","key":"9567_CR7","doi-asserted-by":"publisher","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"},{"issue":"1","key":"9567_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D. (1948). On the rationale of group decision-making. Journal of Political Economy, 56(1), 23\u201334.","journal-title":"Journal of Political Economy"},{"key":"9567_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.artint.2015.06.003","volume":"227","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Caragiannis, I., Haber, S., Tyler, L., Procaccia, A. D., & Sheffet, O. (2015). Optimal social choice functions: A utilitarian view. Artificial Intelligence, 227, 190\u2013213.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9567_CR10","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","volume":"41","author":"R Bredereck","year":"2013","unstructured":"Bredereck, R., Chen, J., & Woeginger, G. J. (2013). A characterization of the single-crossing domain. Social Choice and Welfare, 41(4), 989\u2013998.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9567_CR11","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2981561","volume":"13","author":"J Byrka","year":"2017","unstructured":"Byrka, J., Pensyl, T. W., Rybicki, B., Srinivasan, A., & Trinh, K. (2017). An improved approximation for k-median and positive correlation in budgeted optimization. ACM Transactions on Algorithms, 13(2), 23:1-23:31.","journal-title":"ACM Transactions on Algorithms"},{"key":"9567_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1613\/jair.5282","volume":"58","author":"I Caragiannis","year":"2017","unstructured":"Caragiannis, I., Nath, S., Procaccia, A. D., & Shah, Nisarg. (2017). Subset selection via implicit utilitarian voting. Journal of Artificial Intelligence Research, 58, 123\u2013152.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9567_CR13","doi-asserted-by":"crossref","unstructured":"Charikar, M., & Ramakrishnan, P., (2022). Metric distortion bounds for randomized social choice. In Proceedings of the 2022 ACM-SIAM Symposium on discrete algorithms, SODA 2022, virtual conference \/ Alexandria, VA, USA, January 9 - 12, 2022, pages 2986\u20133004.","DOI":"10.1137\/1.9781611977073.116"},{"issue":"2","key":"9567_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00355-016-1011-y","volume":"48","author":"J Chen","year":"2017","unstructured":"Chen, J., Pruhs, K., & Woeginger, G. J. (2017). The one-dimensional euclidean domain: finitely many obstructions are not enough. Social Choice and Welfare, 48(2), 409\u2013432.","journal-title":"Social Choice and Welfare"},{"key":"9567_CR15","doi-asserted-by":"crossref","unstructured":"Chen, X., Li, M., & Wang, C., (2020). Favorite-candidate voting for eliminating the least popular candidate in a metric space. In The thirty-fourth AAAI conference on artificial intelligence, AAAI 2020, The thirty-second innovative applications of artificial intelligence conference, IAAI 2020, The Tenth AAAI symposium on educational advances in artificial intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1894\u20131901.","DOI":"10.1609\/aaai.v34i02.5558"},{"key":"9567_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.tcs.2011.11.041","volume":"497","author":"Y Cheng","year":"2013","unstructured":"Cheng, Y., Wei, Y., & Zhang, Guochuan. (2013). Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoretical Computer Science, 497, 154\u2013163.","journal-title":"Theoretical Computer Science"},{"key":"9567_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105468","volume":"138","author":"RL Church","year":"2022","unstructured":"Church, R. L., & Drezner, Z. (2022). Review of obnoxious facilities location problems. Computers & Operations Research, 138, 105468.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"9567_CR18","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"JP Doignon","year":"1994","unstructured":"Doignon, J. P., & Falmagne, Jean-Claude. (1994). A polynomial time algorithm for unidimensional unfolding representations. Journal of Algorithms, 16(2), 218\u2013233.","journal-title":"Journal of Algorithms"},{"key":"9567_CR19","doi-asserted-by":"crossref","unstructured":"Elkind, E., & Faliszewski, P., (2014). Recognizing 1-Euclidean preferences: an alternative approach. In Proceedings of the 7th international symposium on algorithmic game theory (SAGT 2014), pages 146\u2013157.","DOI":"10.1007\/978-3-662-44803-8_13"},{"key":"9567_CR20","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., & Slinko, A. M., (2012). Clone structures in voters\u2019 preferences. In Proceedings of the 13th ACM conference on electronic commerce, EC 2012, Valencia, Spain, June 4-8, 2012, pages 496\u2013513.","DOI":"10.1145\/2229012.2229050"},{"key":"9567_CR21","volume-title":"The spatial theory of voting: An introduction","author":"JM Enelow","year":"1984","unstructured":"Enelow, J. M., & Hinich, M. J. (1984). The spatial theory of voting: An introduction. Cambridge University Press."},{"key":"9567_CR22","unstructured":"Bruno Escoffier, J\u00e9r\u00f4me Lang, & Meltem \u00d6zt\u00fcrk. (2018). Single-peaked consistency and its complexity. In ECAI 2008 - 18th european conference on artificial intelligence, Patras, Greece, July 21-25, 2008, Proceedings, pages 366\u2013370."},{"key":"9567_CR23","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., & Golomb, I., (2016). On voting and facility location. In Proceedings of the 2016 ACM Conference on economics and computation, EC \u201916, Maastricht, The Netherlands, July 24-28, 2016, pages 269\u2013286.","DOI":"10.1145\/2940716.2940725"},{"key":"9567_CR24","doi-asserted-by":"crossref","unstructured":"Gkatzelis, V., Halpern, D., & Shah, N., (2020). Resolving the optimal metric distortion conjecture. In 61st IEEE annual symposium on foundations of computer science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 1427\u20131438.","DOI":"10.1109\/FOCS46700.2020.00134"},{"key":"9567_CR25","doi-asserted-by":"crossref","unstructured":"Goel, A., Hulett, R., & Krishnaswamy, A. K., (2018). Relating metric distortion and fairness of social choice rules. In Proceedings of the 13th workshop on economics of networks, systems and computation, NetEcon@SIGMETRICS 2018, Irvine, CA, USA, June 18, 2018, page 4:1.","DOI":"10.1145\/3230654.3230658"},{"key":"9567_CR26","doi-asserted-by":"crossref","unstructured":"Gross, S., Anshelevich, E., & Xia, L., (2017). Vote until two of you agree: mechanisms with small distortion and sample complexity. In Proceedings of the 31st AAAI conference on artificial intelligence, pages 544\u2013550. AAAI Press.","DOI":"10.1609\/aaai.v31i1.10587"},{"key":"9567_CR27","doi-asserted-by":"crossref","unstructured":"Hosseini, S., & Moharerhaye Esfahani, A. (2009). Obnoxious facility location (pp. 315\u2013345). Physica-Verlag Heidelberg.","DOI":"10.1007\/978-3-7908-2151-2_14"},{"key":"9567_CR28","unstructured":"Karlin, Samuel. (1968). Total Positivity. Stanford University Press."},{"key":"9567_CR29","doi-asserted-by":"crossref","unstructured":"Kempe, D., (2020). An analysis framework for metric voting based on LP duality. In Proceedings of the 34th AAAI conference on artificial intelligence (AAAI 2020), pages 2079\u20132086. AAAI Press.","DOI":"10.1609\/aaai.v34i02.5581"},{"key":"9567_CR30","doi-asserted-by":"crossref","unstructured":"Kempe, D., (2020). Communication, distortion, and randomness in metric voting. In Proceedings of the 34th AAAI conference on artificial intelligence (AAAI 2020), pages 2087\u20132094. AAAI Press.","DOI":"10.1609\/aaai.v34i02.5582"},{"issue":"1","key":"9567_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2009.05.007","volume":"46","author":"V Knoblauch","year":"2010","unstructured":"Knoblauch, V. (2010). Recognizing one-dimensional euclidean preference profiles. Journal of Mathematical Economics, 46(1), 1\u20135.","journal-title":"Journal of Mathematical Economics"},{"key":"9567_CR32","doi-asserted-by":"crossref","unstructured":"Mandal, D., Shah, N., & David, P., (2020). Woodruff. Optimal communication-distortion tradeoff in voting. In EC \u201920: The 21st ACM conference on economics and computation, virtual event, hungary, July 13-17, 2020, pages 795\u2013813.","DOI":"10.1145\/3391403.3399510"},{"key":"9567_CR33","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2017.09.020","volume":"734","author":"L Mei","year":"2018","unstructured":"Mei, L., Ye, D., & Zhang, G. (2018). Mechanism design for one-facility location game with obnoxious effects on a line. Theoretical Computer Science, 734, 46\u201357.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9567_CR34","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10878-016-0105-x","volume":"36","author":"L Mei","year":"2018","unstructured":"Mei, L., Ye, D., & Zhang, Y. (2018). Approximation strategy-proof mechanisms for obnoxious facility location on a line. Journal of Combinatorial Optimization, 36(2), 549\u2013571.","journal-title":"Journal of Combinatorial Optimization"},{"key":"9567_CR35","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"JA Mirrlees","year":"1971","unstructured":"Mirrlees, J. A. (1971). An exploration in the theory of optimal income taxation. Review of Economic Studies, 38, 175\u2013208.","journal-title":"Review of Economic Studies"},{"key":"9567_CR36","doi-asserted-by":"crossref","unstructured":"Munagala, K., & Wang, K., (2019). Improved metric distortion for deterministic social choice rules. In Proceedings of the 2019 ACM conference on economics and computation, EC 2019, pages 245\u2013262.","DOI":"10.1145\/3328526.3329550"},{"key":"9567_CR37","doi-asserted-by":"crossref","unstructured":"Procaccia, A. D., & Jeffrey, S. (2006). Rosenschein. The distortion of cardinal preferences in voting. In Cooperative Information Agents X, 10th international workshop, CIA 2006, Edinburgh, UK, September 11-13, 2006, Proceedings, pages 317\u2013331.","DOI":"10.1007\/11839354_23"},{"issue":"4","key":"9567_CR38","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir, A. (1991). Obnoxious facility location on graphs. SIAM Journal on Discrete Mathematics, 4(4), 550\u2013567.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9567_CR39","volume-title":"Vazirani","author":"V Vijay","year":"2001","unstructured":"Vijay, V. (2001). Vazirani. Approximation algorithms: Springer."},{"key":"9567_CR40","volume-title":"Facility Location Applications and Theory","author":"D Zvi","year":"2004","unstructured":"Zvi, D., & Hamacher, H. W. (2004). Facility Location Applications and Theory. Springer."},{"key":"9567_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/CBO9781107446984.003","volume-title":"Handbook of computational social choice","author":"WS Zwicker","year":"2016","unstructured":"Zwicker, W. S. (2016). Introduction to the theory of voting. Handbook of computational social choice (pp. 23\u201356). Cambridge University Press."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09567-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09567-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09567-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T12:51:25Z","timestamp":1667047885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09567-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,18]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9567"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09567-5","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,18]]},"assertion":[{"value":"25 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"37"}}