{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:22:00Z","timestamp":1778494920975,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030891879","type":"print"},{"value":"9783030891886","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-89188-6_9","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Strategy Proof Mechanisms for Facility Location at Limited Locations"],"prefix":"10.1007","author":[{"given":"Toby","family":"Walsh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 18:1\u201318:26 (2013)","DOI":"10.1145\/2542174.2542175"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Golowich, N., Narasimhan, H., Parkes, D.: Deep learning for multi-facility location mechanism design. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, International Joint Conferences on Artificial Intelligence Organization, pp. 261\u2013267 (7 2018)","DOI":"10.24963\/ijcai.2018\/36"},{"key":"9_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: Conitzer, V., Sha, F. (eds.) Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5547"},{"key":"9_CR4","unstructured":"Walsh, T.: Strategy proof mechanisms for facility location with capacity limits. Technical report, CoRR archive within arXiv.org, Cornell University Library. http:\/\/arxiv.org\/abs\/2009.07986 (September 2020)"},{"key":"9_CR5","volume-title":"Facility Location: Applications and Theory","year":"2002","unstructured":"Drezner, Z., Hamacher, H. (eds.): Facility Location: Applications and Theory. Berlin, Springer (2002)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1016\/j.ejor.2019.08.003","volume":"280","author":"C Jagtenberg","year":"2020","unstructured":"Jagtenberg, C., Mason, A.: Improving fairness in ambulance planning by time sharing. Eur. J. Oper. Res. 280(3), 1095\u20131107 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010, New York, pp. 315\u2013324. ACM (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-24873-3_6","volume-title":"Algorithmic Decision Theory","author":"B Escoffier","year":"2011","unstructured":"Escoffier, B., Gourv\u00e8s, L., Kim Thang, N., Pascual, F., Spanjaard, O.: Strategy-proof mechanisms for facility location games with many facilities. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 67\u201381. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_6"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: Conitzer, V., Bergemann, D., Chen, Y., (eds.) Proceedings of the 2016 ACM Conference on Economics and Computation, (EC 2016), pp. 269\u2013286. ACM (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Tang, Z., Wang, C., Zhang, M., Zhao, Y.: Mechanism design for facility location games with candidate locations. CoRR archive within arXiv.org, Cornell University Library, Technical report (2020)","DOI":"10.1007\/978-3-030-64843-5_30"},{"key":"9_CR11","unstructured":"Mei, L., Li, M., Ye, D., Zhang, G.: Strategy-proof mechanism design for facility location games: revisited (extended abstract). In: Jonker, C.M., Marsella, S., Thangarajah, J., Tuyls, K., (eds.) Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, 9\u201313 May 2016, pp. 1463\u20131464. ACM (2016)"},{"key":"9_CR12","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)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9_CR13","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":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.geb.2010.12.001","volume":"72","author":"J Mass\u00f3","year":"2011","unstructured":"Mass\u00f3, J., de Barreda, I.M.: On strategy-proofness and symmetric single-peakedness. Games Econ. Behav. 72(2), 467\u2013484 (2011)","journal-title":"Games Econ. Behav."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-39206-1_38","volume-title":"Automata, Languages, and Programming","author":"D Fotakis","year":"2013","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 449\u2013460. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_38"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Challenges in resource and cost allocation. In: Proceedings of the 29th AAAI Conference on AI, Association for Advancement of Artificial Intelligence, pp. 25\u201330 (2015)","DOI":"10.1609\/aaai.v29i1.9774"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Fair division: the computer scientist\u2019s perspective. In: Bessiere, C., (ed.) Proceedings of 29th International Joint Conference on Artificial Intelligence, pp. 4966\u20134972 (2020)","DOI":"10.24963\/ijcai.2020\/691"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., Walsh, T.: Online fair division: a survey. In: Conitzer, V., Sha, F., (eds.) Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI Press (2020)","DOI":"10.1609\/aaai.v34i09.7081"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Strategic behaviour when allocating indivisible goods. In: Schuurmans, D., Wellman, M., (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, pp. 4177\u20134183 (2016)","DOI":"10.1609\/aaai.v30i1.9877"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-67504-6_19","volume-title":"Algorithmic Decision Theory","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Goldberg, P., Walsh, T.: Equilibria in sequential allocation. In: Rothe, J. (ed.) ADT 2017. LNCS (LNAI), vol. 10576, pp. 270\u2013283. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_19"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T15:52:01Z","timestamp":1673625121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_9","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":"25 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","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":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","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":"382","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":"93","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":"28","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":"24% - 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":"5","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)"}}]}}