{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:41:46Z","timestamp":1779399706412,"version":"3.53.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031710322","type":"print"},{"value":"9783031710339","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-71033-9_9","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"147-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The k-Facility Location Problem via Optimal Transport: A Bayesian Study of\u00a0the\u00a0Percentile Mechanisms"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Auricchio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.cor.2016.05.018","volume":"79","author":"A Ahmadi-Javid","year":"2017","unstructured":"Ahmadi-Javid, A., Seyedi, P., Syam, S.S.: A survey of healthcare facility location. Comput. Oper. Res. 79, 223\u2013263 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9_CR2","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":"9_CR3","doi-asserted-by":"publisher","unstructured":"Ambrosio, L., Gigli, N., Savar\u00e9, G.: Gradient Flows: In Metric Spaces and in the Space of Probability Measures. Springer Science & Business Media, Berlin (2005). https:\/\/doi.org\/10.1007\/978-3-7643-8722-8","DOI":"10.1007\/978-3-7643-8722-8"},{"issue":"4","key":"9_CR4","first-page":"745","volume":"34","author":"G Auricchio","year":"2024","unstructured":"Auricchio, G.: On the pythagorean structure of the optimal transport for separable cost functions. Rendiconti Lincei 34(4), 745\u2013771 (2024)","journal-title":"Rendiconti Lincei"},{"key":"9_CR5","unstructured":"Auricchio, G., Bassetti, F., Gualandi, S., Veneroni, M.: Computing kantorovich-wasserstein distances on $$ d $$-dimensional histograms using $$(d+ 1) $$-partite graphs. In: Advances in Neural Information Processing Systems, vol.\u00a031, pp. 5798\u20135808 (2018)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-19212-9_23","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"G Auricchio","year":"2019","unstructured":"Auricchio, G., Bassetti, F., Gualandi, S., Veneroni, M.: Computing Wasserstein Barycenters via linear programming. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 355\u2013363. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_23"},{"key":"9_CR7","unstructured":"Auricchio, G., Clough, H.J., Zhang, J.: On the capacitated facility location problem with scarce resources. In: The 40th Conference on Uncertainty in Artificial Intelligence (2024)"},{"issue":"3","key":"9_CR8","first-page":"627","volume":"31","author":"G Auricchio","year":"2020","unstructured":"Auricchio, G., Codegoni, A., Gualandi, S., Toscani, G., Veneroni, M.: The equivalence of fourier-based and wasserstein metrics on imaging problems. Rendiconti Lincei 31(3), 627\u2013649 (2020)","journal-title":"Rendiconti Lincei"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Auricchio, G., Wang, Z., Zhang, J.: Facility location problems with capacity constraints: two facilities and beyond. arXiv preprint arXiv:2404.13566 (2024)","DOI":"10.24963\/ijcai.2024\/293"},{"key":"9_CR10","unstructured":"Auricchio, G., Zhang, J.: The k-facility location problem via optimal transport: a Bayesian study of the percentile mechanisms (2024). https:\/\/arxiv.org\/abs\/2407.06398"},{"key":"9_CR11","unstructured":"Auricchio, G., Zhang, J., Zhang, M.: Extended ranking mechanisms for the m-capacitated facility location problem in Bayesian mechanism design. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, pp. 87\u201395. AAMAS \u201924 (2024)"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/13675560701561789","volume":"11","author":"B Balcik","year":"2008","unstructured":"Balcik, B., Beamon, B.M.: Facility location in humanitarian relief. Int. J. Log. Res. Appl. 11(2), 101\u2013121 (2008)","journal-title":"Int. J. Log. Res. Appl."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jeth.2000.2782","volume":"101","author":"S Barbera","year":"2001","unstructured":"Barbera, S., Dutta, B., Sen, A.: Strategy-proof social choice correspondences. J. Econ. Theory 101(2), 374\u2013394 (2001)","journal-title":"J. Econ. Theory"},{"issue":"2\u20133","key":"9_CR14","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0377-2217(90)90197-J","volume":"45","author":"OH Barda","year":"1990","unstructured":"Barda, O.H., Dupuis, J., Lencioni, P.: Multicriteria location of thermal power plants. Eur. J. Oper. Res. 45(2\u20133), 332\u2013346 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Bobkov, S., Ledoux, M.: One-dimensional empirical measures, order statistics, and Kantorovich transport distances, vol. 261. American Mathematical Society, Providence, Rhode Island (2019)","DOI":"10.1090\/memo\/1259"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Kleinberg, R.: Algorithmic pricing via virtual valuations. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 243\u2013251. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1250910.1250946"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2692375.2692378","volume":"13","author":"S Chawla","year":"2014","unstructured":"Chawla, S., Sivan, B.: Bayesian algorithmic mechanism design. ACM SIGecom Exchanges 13(1), 5\u201349 (2014)","journal-title":"ACM SIGecom Exchanges"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Deckelbaum, A., Tzamos, C.: Mechanism design via optimal transport. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 269\u2013286. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2492002.2482593"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"De\u00a0Haan, L., Taconis-Haantjes, E.: On bahadur\u2019s representation of sample quantiles. Ann. Inst. Statist. Math 31(Part A), 299\u2013308 (1979)","DOI":"10.1007\/BF02480286"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: EC, pp. 423\u2013440. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"9_CR22","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_CR23","doi-asserted-by":"crossref","unstructured":"Filimonov, A., Meir, R.: Strategyproof facility location mechanisms on discrete trees. In: AAMAS, pp. 510\u2013518. ACM, New York, NY, USA (2021)","DOI":"10.1007\/s10458-022-09592-4"},{"issue":"6","key":"9_CR24","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)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: Strategyproof facility location for concave cost functions. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 435\u2013452. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2492002.2482595"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. ACM Trans. Econ. Comput. 1\u201337 (2014)","DOI":"10.1145\/2665005"},{"key":"9_CR27","unstructured":"Frogner, C., Zhang, C., Mobahi, H., Araya, M., Poggio, T.A.: Learning with a Wasserstein loss. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 203\u2013212. ACM, New York, NY, USA (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Hartline, J.D.: Bayesian mechanism design. Found. Trends\u00ae Theor. Comput. Sci. 8(3), 143\u2013263 (2013)","DOI":"10.1561\/0400000045"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce. ACM (2009)","DOI":"10.1145\/1566374.1566407"},{"issue":"4","key":"9_CR31","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1007\/s10958-006-0049-2","volume":"133","author":"LV Kantorovich","year":"2006","unstructured":"Kantorovich, L.V.: On the translocation of masses. J. Math. Sci. 133(4), 1381\u20131382 (2006)","journal-title":"J. Math. Sci."},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Levina, E., Bickel, P.: The earth mover\u2019s distance is the Mallows distance: some insights from statistics. In: Proceedings of the IEEE International Conference on Computer Vision, vol. 2, pp. 251\u2013256, February 2001","DOI":"10.1109\/ICCV.2001.937632"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: EC, pp. 315\u2013324. ACM (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"9_CR34","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"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Lucier, B., Borodin, A.: Price of anarchy for greedy auctions. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 537\u2013553. SIAM, New York, NY, USA (2010)","DOI":"10.1137\/1.9781611973075.46"},{"issue":"2","key":"9_CR36","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1214\/17-AOS1639","volume":"47","author":"G Lugosi","year":"2019","unstructured":"Lugosi, G., Mendelson, S.: Sub-Gaussian estimators of the mean of a random vector. Ann. Stat. 47(2), 783\u2013794 (2019)","journal-title":"Ann. Stat."},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-30473-7_2","volume-title":"Algorithmic Game Theory","author":"R Meir","year":"2019","unstructured":"Meir, R.: Strategyproof facility location for three agents on a circle. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 18\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_2"},{"issue":"2","key":"9_CR38","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"M Melo","year":"2009","unstructured":"Melo, M., Nickel, S., da Gama, F.S.: Facility location and supply chain management - a review. Eur. J. Oper. Res. 196(2), 401\u2013412 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 129\u2013140. ACM, New York, NY, USA (1999)","DOI":"10.1145\/301250.301287"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Pele, O., Werman, M.: Fast and robust Earth Mover\u2019s Distances. In: Computer Vision, 2009 IEEE 12th International Conference on, pp. 460\u2013467. IEEE (2009)","DOI":"10.1109\/ICCV.2009.5459199"},{"issue":"4","key":"9_CR41","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":"9_CR42","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vis. 40(2), 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vis."},{"issue":"3","key":"9_CR43","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.3934\/mcrf.2022036","volume":"13","author":"A Scagliotti","year":"2023","unstructured":"Scagliotti, A.: Deep learning approximation of diffeomorphisms via linear-control systems. Math. Control Related Fields 13(3), 1226\u20131257 (2023)","journal-title":"Math. Control Related Fields"},{"key":"9_CR44","unstructured":"Scagliotti, A., Farinelli, S.: Normalizing flows as approximations of optimal transport maps via linear-control neural odes (2023)"},{"key":"9_CR45","unstructured":"Sui, X., Boutilier, C., Sandholm, T.: Analysis and optimization of multi-dimensional percentile mechanisms. In: IJCAI, pp. 367\u2013374. Citeseer (2013)"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Tang, P., Yu, D., Zhao, S.: Characterization of group-strategyproof mechanisms for facility location in strictly convex space. In: EC, pp. 133\u2013157. ACM (2020)","DOI":"10.1145\/3391403.3399471"},{"key":"9_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2009","unstructured":"Villani, C.: Optimal Transport: Old and New, vol. 338. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-71050-9"},{"key":"9_CR48","unstructured":"Zampetakis, E., Zhang, F.: Bayesian strategy-proof facility location via robust estimation. In: International Conference on Artificial Intelligence and Statistics, pp. 4196\u20134208. PMLR (2023)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T17:54:04Z","timestamp":1732730044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}