{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:00:10Z","timestamp":1742954410457,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_23","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"303-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Cost-Sharing Scheme for\u00a0the\u00a0k-Product Facility Location Game with\u00a0Penalties"],"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":[[2023,12,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the $$k$$-level uncapacitated facility location problem. Inf. Process. Lett. 72, 161\u2013167 (1999)","journal-title":"Inf. Process. Lett."},{"key":"23_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, 272\u2013306 (2017)","journal-title":"SIAM J. Comput."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for $$k$$-median and facility location problems. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 21\u201329 (2001)","DOI":"10.1145\/380752.380755"},{"key":"23_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D.M., et al.: Algorithms for facility location problems with outliers. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithm, pp. 642\u2013651 (2001)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1007\/s10878-021-00711-7","volume":"43","author":"X Chen","year":"2022","unstructured":"Chen, X., Fang, Q., Liu, W., Ding, Y., Nong, Q.: Strategyproof mechanisms for 2-facility location games with minimax envy. J. Comb. Optim. 43, 1628\u20131644 (2022)","journal-title":"J. Comb. Optim."},{"key":"23_CR6","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., Li, M., Wang, K., Yuan, H., Zhang, Y.: Facility location games with optional preference. Theor. Comput. Sci. 847, 185\u2013197 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"23_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)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algor. 31, 228\u2013248 (1999)","journal-title":"J. Algor."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ejor.2007.01.010","volume":"185","author":"HC Huang","year":"2008","unstructured":"Huang, H.C., Li, R.: A $$k$$-product uncapacitated facility location problem. Eur. J. Oper. Res. 185, 552\u2013562 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1361192.1361201","volume":"4","author":"N Immorlica","year":"2008","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algor. 4, 1\u201325 (2008)","journal-title":"ACM Trans. Algor."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"23_CR13","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":"23_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theory. 18, 511\u2013533 (2001)","journal-title":"Econ. Theory."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategy proof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s40305-021-00345-w","volume":"10","author":"FM Wang","year":"2022","unstructured":"Wang, F.M., Wang, J.J., Li, N., Jiang, Y.J., Li, S.C.: A cost-sharing scheme for the $$k$$-level facility location game with penalties. J. Oper. Res. Soc. China. 10, 173\u2013182 (2022)","journal-title":"J. Oper. Res. Soc. China."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11424-012-9067-y","volume":"25","author":"Z Wang","year":"2012","unstructured":"Wang, Z., Xu, D.: A cost-sharing method for an uncapacitated facility location game with penalties. J. Syst. Sci. Complex. 25, 287\u2013292 (2012)","journal-title":"J. Syst. Sci. Complex."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D Xu","year":"2006","unstructured":"Xu, D., Du, D.: The $$k$$-level facility location game. Oper. Res. Lett. 34, 421\u2013426 (2006)","journal-title":"Oper. Res. Lett."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ye, D., Mei, L., Zhang, Y.: Strategy-proof mechanism for obnoxious facility location on a line. In: Proceedings of the 21st International Conference on Computing and Combinatorics, pp. 45\u201356 (2015)","DOI":"10.1007\/978-3-319-21398-9_4"}],"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-031-49193-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:27:48Z","timestamp":1730824068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","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":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}