{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:38Z","timestamp":1746438158462,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"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_3","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"25-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Heterogeneous Two-Facility Location Games with\u00a0Max-Variant Cost"],"prefix":"10.1007","author":[{"given":"Qi","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4826-2088","authenticated-orcid":false,"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"3_CR1","unstructured":"Anastasiadis, E., Deligkas, A.: Heterogeneous facility location games. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems, pp. 623\u2013631 (2018)"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Aziz, H., Chan, H., Lee, B., Li, B., Walsh, T.: Facility location problem with capacity constraints: algorithmic and mechanism design perspectives. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 2, pp. 1806\u20131813 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i02.5547","DOI":"10.1609\/aaai.v34i02.5547"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.geb.2020.09.001","volume":"124","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Chan, H., Lee, B., Parkes, D.C.: The capacity constrained facility location problem. Games Econ. Behav. 124, 478\u2013490 (2020). https:\/\/doi.org\/10.1016\/j.geb.2020.09.001","journal-title":"Games Econ. Behav."},{"key":"3_CR4","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":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-57602-8_24","volume-title":"Algorithmic Aspects in Information and Management","author":"X Chen","year":"2020","unstructured":"Chen, X., Fang, Q., Liu, W., Ding, Y.: Strategyproof mechanisms for 2-facility location games with minimax envy. In: Zhang, Z., Li, W., Du, D.-Z. (eds.) AAIM 2020. LNCS, vol. 12290, pp. 260\u2013272. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57602-8_24"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"106098","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). https:\/\/doi.org\/10.1016\/j.ipl.2021.106098","journal-title":"Inf. Process. Lett."},{"key":"3_CR7","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). https:\/\/doi.org\/10.1016\/j.tcs.2011.11.041","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"106710","DOI":"10.1016\/j.cie.2020.106710","volume":"148","author":"Y Ding","year":"2020","unstructured":"Ding, Y., Liu, W., Chen, X., Fang, Q., Nong, Q.: Facility location game with envy ratio. Comput. Ind. Eng. 148(3), 106710 (2020). https:\/\/doi.org\/10.1016\/j.cie.2020.106710","journal-title":"Comput. Ind. Eng."},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proceedings of the 13rd ACM Conference on Electronic Commerce, pp. 423\u2013440 (2012). https:\/\/doi.org\/10.1145\/2229012.2229045","DOI":"10.1145\/2229012.2229045"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"277","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. Comput. Sci. Game Theory 42(2), 277\u2013575 (2017). https:\/\/doi.org\/10.1287\/moor.2016.0810","journal-title":"Comput. Sci. Game Theory"},{"key":"3_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2940716.2940725","DOI":"10.1145\/2940716.2940725"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1007\/s10458-017-9361-0","volume":"31","author":"A Filos-Ratsikas","year":"2017","unstructured":"Filos-Ratsikas, A., Li, M., Zhang, J., Zhang, Q.: Facility location with double-peaked preferences. Auton. Agents Multi-Agent Syst. 31(6), 1209\u20131235 (2017). https:\/\/doi.org\/10.1007\/s10458-017-9361-0","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Fong, K., Li, M., Lu, P., Todo, T., Yokoo, T.: Facility location games with fractional preferences. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, pp. 1039\u20131046 (2018). https:\/\/doi.org\/10.1609\/aaai.v32i1.11458","DOI":"10.1609\/aaai.v32i1.11458"},{"issue":"4","key":"3_CR14","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). https:\/\/doi.org\/10.1145\/2665005","journal-title":"ACM Trans. Econ. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.24963\/ijcai.2020\/34","DOI":"10.24963\/ijcai.2020\/34"},{"key":"3_CR16","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. Theor. Comput. Sci. 864, 1\u20139 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.016","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1807342.1807393","DOI":"10.1145\/1807342.1807393"},{"key":"3_CR18","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). https:\/\/doi.org\/10.1016\/j.dam.2019.02.017","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"3_CR19","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). https:\/\/doi.org\/10.1007\/BF00128122","journal-title":"Public Choice"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 177\u2013186 (2009). https:\/\/doi.org\/10.1145\/1566374.1566401","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"3_CR21","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.: Strategy-proof location on a network. J. Econ. Theory 104(2), 405\u2013428 (2002). https:\/\/doi.org\/10.1006\/jeth.2001.2807","journal-title":"J. Econ. Theory"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2016.04.033","volume":"636","author":"P Serafino","year":"2016","unstructured":"Serafino, P., Ventre, C.: Heterogeneous facility location without money. Theor. Comput. Sci. 636, 27\u201346 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.04.033","journal-title":"Theor. Comput. Sci."},{"key":"3_CR23","unstructured":"Sui, X., Boutilier, C.: Approximately strategy-proof mechanisms for (constrained) facility location. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 605\u2013613 (2015)"},{"key":"3_CR24","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":"3_CR25","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). https:\/\/doi.org\/10.1613\/jair.1.12319","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Yuan, H., Wang, K., Fong, K.C., Zhang, Y., Li, M.: Facility location games with optional preference. In: Proceedings of the 22nd European Conference on Artificial Intelligence, pp. 1520\u20131527 (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-1520","DOI":"10.3233\/978-1-61499-672-9-1520"},{"issue":"4","key":"3_CR27","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/s10878-013-9598-8","volume":"28","author":"Q Zhang","year":"2013","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 (2013). https:\/\/doi.org\/10.1007\/s10878-013-9598-8","journal-title":"J. Comb. Optim."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, H., Li, M., Chan, H.: Strategyproof mechanisms for group-fair facility location problems. arXiv preprint arXiv:2107.05175 (2021)","DOI":"10.24963\/ijcai.2022\/87"},{"key":"3_CR29","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","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:48:01Z","timestamp":1672552081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_3","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)"}}]}}