{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:38:52Z","timestamp":1767339532851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_2","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"15-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Facility Location Games with\u00a0Distance Requirement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0710-8498","authenticated-orcid":false,"given":"Ling","family":"Gai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5967-227X","authenticated-orcid":false,"given":"Dandan","family":"Qian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6742-8816","authenticated-orcid":false,"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Chan, H., Filos-Ratsikas, A., Li, B., Li, M., Wang, C.: Mechanism design for facility location problems: a survey. arXiv preprint arXiv:2106.03457 (2021)","DOI":"10.24963\/ijcai.2021\/596"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/17M1131027","volume":"48","author":"J Chen","year":"2019","unstructured":"Chen, J., Li, B., Li, Y.: Efficient approximations for the online dispersion problem. SIAM J. Comput. 48(2), 373\u2013416 (2019)","journal-title":"SIAM J. Comput."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-22616-8_21","volume-title":"Combinatorial Optimization and Applications","author":"Y Cheng","year":"2011","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Mechanisms for obnoxious facility game on a path. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 262\u2013271. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22616-8_21"},{"key":"2_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.: Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor. Comput. Sci. 497, 154\u2013163 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR5","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, pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"2_CR6","unstructured":"Duan, L., Li, B., Li, M., Xu, X.: Heterogeneous two-facility location games with minimum distance requirement. In: AAMAS, pp. 1461\u20131469 (2019)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 269\u2013286 (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2021.01.028","volume":"858","author":"D Fotakis","year":"2021","unstructured":"Fotakis, D., Kavouras, L., Kostopanagiotis, P., Lazos, P., Skoulakis, S., Zarifis, N.: Reallocating multiple facilities on the line. Theor. Comput. Sci. 858, 13\u201334 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","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. (TEAC) 2(4), 1\u201337 (2014)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"2_CR10","unstructured":"Golomb, I., Tzamos, C.: Truthful facility location with additive errors. arXiv preprint arXiv:1701.00529 (2017)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Krogmann, S., Lenzner, P., Molitor, L., Skopalik, A.: Two-stage facility location games with strategic clients and facilities. arXiv preprint arXiv:2105.01425 (2021)","DOI":"10.24963\/ijcai.2021\/41"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Li, M., Wang, C., Zhang, M.: Budgeted facility location games with strategic facilities. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp. 400\u2013406 (2021)","DOI":"10.24963\/ijcai.2020\/56"},{"key":"2_CR13","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":"2_CR14","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. Discrete Appl. Math. 264, 148\u2013160 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","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. (TEAC) 1(4), 1\u201326 (2013)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-030-92681-6_39","volume-title":"Combinatorial Optimization and Applications","author":"X Wu","year":"2021","unstructured":"Wu, X., Mei, L., Zhang, G.: Two-facility location games with a minimum distance requirement on a circle. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 497\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_39"},{"key":"2_CR17","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."},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/s10878-013-9598-8","volume":"28","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Li, M.: Strategyproof mechanism design for facility location games with weighted agents on a line. J. Comb. Optim. 28(4), 756\u2013773 (2014). https:\/\/doi.org\/10.1007\/s10878-013-9598-8","journal-title":"J. Comb. Optim."},{"key":"2_CR19","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 615\u2013623 (2015)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:46:39Z","timestamp":1672551999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}