{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:40:10Z","timestamp":1751193610254,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_23","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:01Z","timestamp":1751192101000},"page":"307-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Capacity-Constrained Facility Location Problem with\u00a0Ordinal Preferences: Algorithmic and\u00a0Mechanism Design Perspectives"],"prefix":"10.1007","author":[{"given":"Zifan","family":"Gong","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Momcilo","family":"Mrkaic","sequence":"additional","affiliation":[]},{"given":"Yachao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"K Aardal","year":"2015","unstructured":"Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated k-facility location problems. Eur. J. Oper. Res. 242(2), 358\u2013368 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Auricchio, G., Wang, Z., Zhang, J.: Facility location problems with capacity constraints: two facilities and beyond. In: Larson, K. (ed.) Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, pp. 2651\u20132659. International Joint Conferences on Artificial Intelligence Organization (2024). https:\/\/doi.org\/10.24963\/ijcai.2024\/293","DOI":"10.24963\/ijcai.2024\/293"},{"key":"23_CR3","doi-asserted-by":"crossref","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 AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1806\u20131813 (2020)","DOI":"10.1609\/aaai.v34i02.5547"},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1111\/1475-3995.t01-1-00334","volume":"8","author":"J Brimberg","year":"2001","unstructured":"Brimberg, J., Korach, E., Eben-Chaim, M., Mehrez, A.: The capacitated p-facility location problem on the real line. Int. Trans. Oper. Res. 8(6), 727\u2013738 (2001)","journal-title":"Int. Trans. Oper. Res."},{"key":"23_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114208","volume":"979","author":"H Chan","year":"2023","unstructured":"Chan, H., Gong, Z., Li, M., Wang, C., Zhao, Y.: Facility location games with ordinal preferences. Theoret. Comput. Sci. 979, 114208 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"23_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., 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":"23_CR7","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer (2009)"},{"key":"23_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.\u00a032 (2018)","DOI":"10.1609\/aaai.v32i1.11458"},{"issue":"4","key":"23_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":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0166-0462(87)90011-1","volume":"17","author":"P Hanjoul","year":"1987","unstructured":"Hanjoul, P., Peeters, D.: A facility location problem with clients\u2019 preference orderings. Reg. Sci. Urban Econ. 17(3), 451\u2013473 (1987)","journal-title":"Reg. Sci. Urban Econ."},{"key":"23_CR11","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"},{"issue":"4","key":"23_CR12","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":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"SH Owen","year":"1998","unstructured":"Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111(3), 423\u2013447 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Pal, M., Tardos, T., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 329\u2013338. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959907"},{"key":"23_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1566374.1566401"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Heterogeneous facility location without money on the line. In: ECAI 2014, pp. 807\u2013812. IOS Press (2014)","DOI":"10.3233\/978-1-61499-419-0-807"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a029 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"issue":"7","key":"23_CR18","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547\u2013564 (2006)","journal-title":"IIE Trans."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1134\/S0965542509060098","volume":"49","author":"IL Vasil\u2019ev","year":"2009","unstructured":"Vasil\u2019ev, I.L., Klimentova, K.B., Kochetov, Y.A.: New lower bounds for the facility location problem with clients\u2019 preferences. Comput. Math. Math. Phys. 49, 1010\u20131020 (2009)","journal-title":"Comput. Math. Math. Phys."},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Walsh, T.: Strategy proof mechanisms for facility location with capacity limits. In: Raedt, L.D. (ed.) Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, pp. 527\u2013533. International Joint Conferences on Artificial Intelligence Organization (2022). https:\/\/doi.org\/10.24963\/ijcai.2022\/75","DOI":"10.24963\/ijcai.2022\/75"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Ye, D., Mei, L., Zhang, Y.: Strategy-proof mechanism for obnoxious facility location on a line. In: International Computing and Combinatorics Conference, pp. 45\u201356. Springer (2015)","DOI":"10.1007\/978-3-319-21398-9_4"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:05Z","timestamp":1751192105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}