{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:54Z","timestamp":1767339234235,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_39","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"497-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Facility Location Games with\u00a0a\u00a0Minimum Distance Requirement on\u00a0a\u00a0Circle"],"prefix":"10.1007","author":[{"given":"Xiaoyu","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"39_CR1","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation mechanisms for location on networks. CoRR, abs\/0907.2049 (2009)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Fang, Q., Liu, W., Ding, Y., Nong, Q.: Strategyproof mechanisms for 2-facility location games with minimax envy. J. Comb. Optim., 1\u201317 (2021)","DOI":"10.1007\/s10878-021-00711-7"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.tcs.2020.10.004","volume":"847","author":"Z Chen","year":"2020","unstructured":"Chen, Z., Fong, K.C.K., Li, M., Wang, K., Yuan, H., Zhang, Y.: Facility location games with optional preference. Theoret. Comput. Sci. 847, 185\u2013197 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10878-018-0344-0","volume":"37","author":"Y Cheng","year":"2019","unstructured":"Cheng, Y., Han, Q., Wei, Yu., Zhang, G.: Strategy-proof mechanisms for obnoxious facility game with bounded service range. J. Comb. Optim. 37(2), 737\u2013755 (2019)","journal-title":"J. Comb. Optim."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Mechanisms for obnoxious facility game on a path. In: Proceedings of the 5th International Conference on Combinatorial Optimization and Applications, pp. 262\u2013271 (2011)","DOI":"10.1007\/978-3-642-22616-8_21"},{"key":"39_CR6","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, Yu., Zhang, G.: Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoret. Comput. Sci. 497, 154\u2013163 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR7","unstructured":"Duan, L., Li, B., Li, M., Xu, X.: Heterogeneous two-facility location games with minimum distance requirement. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1461\u20131469 (2019)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Fong, C.K.K., Li, M., Lu, P., Todo, T., Yokoo, M.: Facility location games with fractional preferences. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11458"},{"issue":"4","key":"39_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. 2(4), 1\u201337 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Ibara, K., Nagamochi, H.: Characterizing mechanisms in obnoxious facility game. In: Proceedings of the 6th International Conference on Combinatorial Optimization and Applications, pp. 301\u2013311 (2012)","DOI":"10.1007\/978-3-642-31770-5_27"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Lu, P., Yao, Y., Zhang, J.: Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 238\u2013245 (2020)","DOI":"10.24963\/ijcai.2020\/34"},{"key":"39_CR12","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":"39_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":"39_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. Discret. Appl. Math. 264, 148\u2013160 (2019)","journal-title":"Discret. Appl. Math."},{"key":"39_CR15","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.: Mechanism design for one-facility location game with obnoxious effects on a line. Theoret. Comput. Sci. 734, 46\u201357 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"issue":"4","key":"39_CR17","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. 1(4), 1\u201326 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"39_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J Schummer","year":"2002","unstructured":"Schummer, J., Vohra, R.V.: Strategy-proof location on a network. J. Econ. Theory 104(2), 405\u2013428 (2002)","journal-title":"J. Econ. Theory"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 25\u201330 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"39_CR20","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":"39_CR21","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","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T22:23:42Z","timestamp":1673994222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}