{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T08:59:50Z","timestamp":1768467590071,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030648428","type":"print"},{"value":"9783030648435","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_30","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"440-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Mechanism Design for Facility Location Games with Candidate Locations"],"prefix":"10.1007","author":[{"given":"Zhongzheng","family":"Tang","sequence":"first","affiliation":[]},{"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Mengqi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Math. Oper. Res. 35(3), 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1613\/jair.5340","volume":"58","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Postl, J.: Randomized social choice functions under metric preferences. J. Artif. Intell. Res. 58, 797\u2013827 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR3","unstructured":"Aziz, H., Chan, H., Lee, B.E., Parkes, D.C.: The capacity constrained facility location problem. In: Proceeding of the 15th Conference on Web and Internet Economics (WINE), p. 336 (2019)"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2307\/2296962","volume":"50","author":"KC Border","year":"1983","unstructured":"Border, K.C., Jordan, J.S.: Straightforward elections, unanimity and phantom voters. Rev. Econ. Stud. 50(1), 153\u2013170 (1983)","journal-title":"Rev. Econ. Stud."},{"key":"30_CR5","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":"30_CR6","unstructured":"Chen, X., Li, M., Wang, C., Wang, C., Zhao, Y.: Truthful mechanisms for location games of dual-role facilities. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 1470\u20131478 (2019)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM Conference on Electronic Commerce (ACM-EC), pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In Proceedings of the 17th ACM Conference on Economics and Computation (ACM-EC), pp. 269\u2013286 (2016)","DOI":"10.1145\/2940716.2940725"},{"issue":"4","key":"30_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)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-30473-7_5","volume-title":"Algorithmic Game Theory","author":"M Kyropoulou","year":"2019","unstructured":"Kyropoulou, M., Ventre, C., Zhang, X.: Mechanism design for constrained heterogeneous facility location. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 63\u201376. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_5"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Wang, C., Zhang, M.: Budgeted facility location games with strategic facilities. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 400\u2013406 (2020)","DOI":"10.24963\/ijcai.2020\/56"},{"key":"30_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: Proceedings of the 11th ACM Conference on Electronic Commerce (ACM-EC), pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"30_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"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00849ED1V01Y201804AIM038","volume":"13","author":"R Meir","year":"2018","unstructured":"Meir, R.: Strategic voting. Synthesis Lectures on Artificial Intelligence and Machine Learning 13(1), 1\u2013167 (2018)","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.artint.2012.03.008","volume":"186","author":"R Meir","year":"2012","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S.: Algorithms for strategyproof classification. Artif. Intell. 186, 123\u2013156 (2012)","journal-title":"Artif. Intell."},{"key":"30_CR16","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 (ACM-EC), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"issue":"4","key":"30_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. (TEAC) 1(4), 1\u201326 (2013)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"2","key":"30_CR18","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.V.: Strategy-proof location on a network. J. Econ. Theory 104(2), 405\u2013428 (2002)","journal-title":"J. Econ. Theory"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pp. 1029\u20131035 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"30_CR20","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 (AAMAS), pp. 605\u2013613 (2015)"},{"key":"30_CR21","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 615\u2013623 (2015)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T12:00:07Z","timestamp":1669982407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}