{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:05:31Z","timestamp":1757617531705,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_13","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:01Z","timestamp":1741105981000},"page":"151-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Facility Location Game for\u00a0Maximizing the\u00a0Social Satisfaction on\u00a0a\u00a0Line"],"prefix":"10.1007","author":[{"given":"Xiaowei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"3","key":"13_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. Math. Oper. Res. 35(3), 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/151002320","volume":"46","author":"HC An","year":"2017","unstructured":"An, H.C., Singh, M., Svensson, O.: Lp-based algorithms for capacitated facility location. SIAM J. Comput. 46(1), 272\u2013306 (2017)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","unstructured":"Cai, Q., Filos-Ratsikas, A., Tang, P.: Facility location with minimax envy. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 137\u2013143 (2016)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chan, H., Filos-Ratsikas, A., Li, B., Li, M., Wang, C.: Mechanism design for facility location problems: a survey. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence, pp. 4356\u20134365 (2021)","DOI":"10.24963\/ijcai.2021\/596"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2022.08.007","volume":"932","author":"X Chen","year":"2022","unstructured":"Chen, X., Li, M., Wang, C., Wang, C., Zhang, M., Zhao, Y.: Mechanisms for dual-role-facility location games: truthfulness and approximability. Theoret. Comput. Sci. 932, 69\u201383 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: Proceedings of the 17th ACM Conference on Economics and Computation, pp. 269\u2013286 (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. In: Proceedings of the 40th International Colloquium on Automata, Languages and Programming, pp. 449\u2013460 (2013)","DOI":"10.1007\/978-3-642-39206-1_38"},{"issue":"1","key":"13_CR8","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.: Strategyproof facility location for concave cost functions. Algorithmica 76(1), 143\u2013167 (2016)","journal-title":"Algorithmica"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kanellopoulos, P., Voudouris, A.A., Zhang, R.: Truthful two-facility location with candidate locations. In: Proceedings of the 16th International Symposium on Algorithmic Game Theory, pp. 365\u2013382 (2023)","DOI":"10.1007\/978-3-031-43254-5_21"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.016","volume":"864","author":"W Liu","year":"2021","unstructured":"Liu, W., Ding, Y., Chen, X., Fang, Q., Nong, Q.: Multiple facility location games with envy ratio. Theoret. Comput. Sci. 864, 1\u20139 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR11","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, pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.dam.2019.02.017","volume":"264","author":"L Mei","year":"2019","unstructured":"Mei, L., Li, M., Ye, D., Zhang, G.: Facility location games with distinct desires. Discret. Appl. Math. 264, 148\u2013160 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 177\u2013186 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Tang, Z., Wang, C., Zhang, M., Zhao, Y.: Mechanism design for facility location games with candidate locations. In: Proceedings of the 14th Annual International Conference on Combinatorial Optimization and Applications, pp. 440\u2013452 (2020)","DOI":"10.1007\/978-3-030-64843-5_30"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1613\/jair.1.12319","volume":"70","author":"X Xu","year":"2021","unstructured":"Xu, X., Li, B., Li, M., Duan, L.: Two-facility location games with minimum distance requirement. J. Artif. Intell. Res. 70, 719\u2013756 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR16","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 615\u2013623 (2015)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:08:44Z","timestamp":1757142524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}