{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:24:45Z","timestamp":1792070685381,"version":"4.4.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030895426","type":"print"},{"value":"9783030895433","type":"electronic"}],"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-89543-3_42","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"499-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mechanism Design for Facility Location\u00a0with Fractional Preferences and\u00a0Minimum Distance"],"prefix":"10.1007","author":[{"given":"Longteng","family":"Duan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zifan","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoying","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"42_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. In: IJCAI (2021)","DOI":"10.24963\/ijcai.2021\/596"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-99660-8_24","volume-title":"Algorithmic Game Theory","author":"X Chen","year":"2018","unstructured":"Chen, X., Hu, X., Jia, X., Li, M., Tang, Z., Wang, C.: Mechanism design for two-opposite-facility location games with penalties on distance. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 256\u2013260. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_24"},{"key":"42_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106098","volume":"168","author":"X Chen","year":"2021","unstructured":"Chen, X., Hu, X., Tang, Z., Wang, C.: Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. Inf. Process. Lett. 168, 106098 (2021)","journal-title":"Inf. Process. Lett."},{"key":"42_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. Theoret. Comput. Sci. 497, 154\u2013163 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"42_CR5","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":"42_CR6","unstructured":"Feigenbaum, I., Sethuraman, J.: Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. In: Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)"},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/moor.2016.0810","volume":"42","author":"I Feigenbaum","year":"2017","unstructured":"Feigenbaum, I., Sethuraman, J., Ye, C.: Approximately optimal mechanisms for strategyproof facility location: minimizing $$l_p$$ norm of costs. Math. Oper. Res. 42(2), 434\u2013447 (2017)","journal-title":"Math. Oper. Res."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Fong, K.K.C., Li, M., Lu, P., Todo, T., Yokoo, M.: Facility location games with fractional preferences. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11458"},{"issue":"4","key":"42_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)"},{"issue":"1","key":"42_CR10","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":"42_CR11","doi-asserted-by":"crossref","unstructured":"Hossain, S., Micha, E., Shah, N.: The surprising power of hiding information in facility location. In: AAAI, vol. 34, pp. 2168\u20132175 (2020)","DOI":"10.1609\/aaai.v34i02.5592"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: EC, pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-10841-9_14","volume-title":"Internet and Network Economics","author":"P Lu","year":"2009","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 137\u2013148. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_14"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: EC, pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: AAAI, pp. 1029\u20131035 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Tang, P., Yu, D., Zhao, S.: Characterization of group-strategyproof mechanisms for facility location in strictly convex space. In: EC, pp. 133\u2013157 (2020)","DOI":"10.1145\/3391403.3399471"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-030-64843-5_30","volume-title":"Combinatorial Optimization and Applications","author":"Z Tang","year":"2020","unstructured":"Tang, Z., Wang, C., Zhang, M., Zhao, Y.: Mechanism design for facility location games with candidate locations. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 440\u2013452. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64843-5_30"},{"key":"42_CR18","unstructured":"Wada, Y., Ono, T., Todo, T., Yokoo, M.: Facility location with variable and dynamic populations. In: AAMAS, pp. 336\u2013344 (2018)"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-21398-9_4","volume-title":"Computing and Combinatorics","author":"D Ye","year":"2015","unstructured":"Ye, D., Mei, L., Zhang, Y.: Strategy-proof mechanism for obnoxious facility location on a line. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 45\u201356. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_4"},{"key":"42_CR20","unstructured":"Yuan, H., Wang, K., Fong, C.K.K., Zhang, Y., Li, M.: Facility location games with optional preference. In: ECAI, pp. 1520\u20131527 (2016)"},{"key":"42_CR21","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: AAMAS, 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-3-030-89543-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:38:27Z","timestamp":1673577507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"131","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":"56","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":"43% - 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.1","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.2","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)"}}]}}