{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:53Z","timestamp":1759637693224},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10458-020-09472-9","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T15:03:50Z","timestamp":1595084630000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Strategic facility location problems with linear single-dipped and single-peaked preferences"],"prefix":"10.1007","volume":"34","author":[{"given":"Itai","family":"Feigenbaum","sequence":"first","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jay","family":"Sethuraman","sequence":"additional","affiliation":[]},{"given":"Fangzhou","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shaokun","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"issue":"3","key":"9472_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. (2010). Strategyproof approximation of the minimax on networks. Mathematics of Operations Research, 35(3), 513\u2013526.","journal-title":"Mathematics of Operations Research"},{"issue":"2\u20133","key":"9472_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00355-011-0624-4","volume":"39","author":"S Barber\u00e0","year":"2012","unstructured":"Barber\u00e0, S., Berga, D., & Moreno, B. (2012). Domains, ranges and strategy-proofness: The case of single-dipped preferences. Social Choice and Welfare, 39(2\u20133), 335\u2013352. https:\/\/doi.org\/10.1007\/s00355-011-0624-4.","journal-title":"Social Choice and Welfare"},{"key":"9472_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Han, Q., Yu, W., & Zhang, G. (2013). Obnoxious facility game with a bounded service range. In International conference on theory and applications of models of computation (pp. 272\u2013281). Springer.","DOI":"10.1007\/978-3-642-38236-9_25"},{"key":"9472_CR4","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., Yu, W., & 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":"9472_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, Y., & Zhou, S. (2015). A survey on approximation mechanism design without money for facility games. In Advances in global optimization (pp. 117\u2013128). Springer.","DOI":"10.1007\/978-3-319-08377-3_13"},{"key":"9472_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility location: Concepts, models, algorithms and case studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani, R. Z., & Hekmatfar, M. (2009). Facility location: Concepts, models, algorithms and case studies. Berlin: Springer."},{"issue":"2","key":"9472_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/moor.2016.0810","volume":"42","author":"I Feigenbaum","year":"2016","unstructured":"Feigenbaum, I., Sethuraman, J., & Ye, C. (2016). Approximately optimal mechanisms for strategyproof facility location: Minimizing lp norm of costs. Mathematics of Operations Research, 42(2), 434\u2013447.","journal-title":"Mathematics of Operations Research"},{"key":"9472_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., & Wilf, Y. (2013). Strategyproof facility location and the least squares objective. In Proceedings of the fourteenth ACM conference on electronic commerce (pp. 873\u2013890). ACM.","DOI":"10.1145\/2482540.2482543"},{"issue":"1","key":"9472_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00453-015-0026-6","volume":"76","author":"D Fotakis","year":"2016","unstructured":"Fotakis, D., & Tzamos, C. (2016). Strategyproof facility location for concave cost functions. Algorithmica, 76(1), 143\u2013167.","journal-title":"Algorithmica"},{"issue":"4","key":"9472_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10898-017-0586-x","volume":"70","author":"Q Han","year":"2018","unstructured":"Han, Q., Du, D., Xu, D., & Xu, Y. (2018). Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain. Journal of Global Optimization, 70(4), 859\u2013873.","journal-title":"Journal of Global Optimization"},{"key":"9472_CR11","doi-asserted-by":"crossref","unstructured":"Ibara, K., & Nagamochi, H. (2012). Characterizing mechanisms in obnoxious facility game. In International conference on combinatorial optimization and applications (pp. 301\u2013311). Springer.","DOI":"10.1007\/978-3-642-31770-5_27"},{"issue":"3","key":"9472_CR12","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s00182-013-0396-4","volume":"43","author":"V Manjunath","year":"2014","unstructured":"Manjunath, V. (2014). Efficient and strategy-proof social choice when preferences are single-dipped. International Journal of Game Theory, 43(3), 579\u2013597. https:\/\/doi.org\/10.1007\/s00182-013-0396-4.","journal-title":"International Journal of Game Theory"},{"issue":"4","key":"9472_CR13","doi-asserted-by":"publisher","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":"9472_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic game theory. Cambridge: Cambridge University Press."},{"issue":"4","key":"9472_CR15","first-page":"18","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 (TEAC), 1(4), 18.","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"9472_CR16","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-020-09472-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T23:50:49Z","timestamp":1626565849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-020-09472-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9472"],"URL":"https:\/\/doi.org\/10.1007\/s10458-020-09472-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,18]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"49"}}