{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:03:23Z","timestamp":1746252203622,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723393"},{"type":"electronic","value":"9789819723409"}],"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-981-97-2340-9_28","type":"book-chapter","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:01:51Z","timestamp":1714690911000},"page":"332-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mechanism Design for\u00a0Building Optimal Bridges Between Regions"],"prefix":"10.1007","author":[{"given":"Zining","family":"Qin","sequence":"first","affiliation":[]},{"given":"Hau","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"issue":"5","key":"28_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(00)00228-3","volume":"79","author":"B Bhattacharya","year":"2001","unstructured":"Bhattacharya, B., Benkoczi, R.: On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5), 215\u2013221 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ipl.2004.06.015","volume":"69","author":"L Cai","year":"1999","unstructured":"Cai, L., Xu, Y., Zhu, B.: Computing the optimal bridge between two convex polygons. Inf. Process. Lett. 69(3), 127\u2013130 (1999)","journal-title":"Inf. Process. Lett."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Chan, H., Filos-Ratsikas, A., Li, B., Li, M., Wang, C.: Mechanism design for facility location problems: a survey. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), pp. 4356\u20134365 (2021)","DOI":"10.24963\/ijcai.2021\/596"},{"key":"28_CR4","unstructured":"Chan, H., Wang, C.: Mechanism design for improving accessibility to public facilities. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 2116\u20132124 (2023)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13731-0_39","volume-title":"Algorithm Theory - SWAT 2010","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Zadimoghaddam, M.: Minimizing the diameter of a network using shortcut edges. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 420\u2013431. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_39"},{"key":"28_CR6","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 (EC), pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-85947-3_4","volume-title":"Algorithmic Game Theory","author":"A Filos-Ratsikas","year":"2021","unstructured":"Filos-Ratsikas, A., Voudouris, A.A.: Approximate mechanism design for distributed facility location. In: Caragiannis, I., Hansen, K.A. (eds.) SAGT 2021. LNCS, vol. 12885, pp. 49\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85947-3_4"},{"key":"28_CR8","first-page":"976","volume":"28","author":"Y Fukui","year":"2020","unstructured":"Fukui, Y., Shurbevski, A., Nagamochi, H.: Group strategy-proof mechanisms for shuttle facility games. J. Inf. Process. 28, 976\u2013986 (2020)","journal-title":"J. Inf. Process."},{"key":"28_CR9","unstructured":"Kim, B.J., Shin, C.S., Chwa, K.Y.: Linear algorithms for computing a variant segment center. In: Proceedings of Korean Information Science Society Conference (KISS), vol.\u00a0A, pp. 708\u2013710 (1998). (in Korean)"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00224-001-1018-2","volume":"34","author":"SK Kim","year":"2001","unstructured":"Kim, S.K., Shin, C.S.: Computing the optimal bridge between two polygons. Theory Comput. Syst. 34(4), 337\u2013352 (2001)","journal-title":"Theory Comput. Syst."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tranpol.2012.03.003","volume":"21","author":"G McCartney","year":"2012","unstructured":"McCartney, G., Whyte, B., Livingston, M., Crawford, F.: Building a bridge, transport infrastructure and population characteristics: explaining active travel into glasgow. Transp. Policy 21, 119\u2013125 (2012)","journal-title":"Transp. Policy"},{"key":"28_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. Discret. Appl. Math. 264, 148\u2013160 (2019)","journal-title":"Discret. Appl. Math."},{"key":"28_CR13","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"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Tagiku, B.: Minimizing average shortest path distances via shortcut edge addition. In: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), vol.\u00a05687, pp. 272\u2013285 (2009)","DOI":"10.1007\/978-3-642-03685-9_21"},{"issue":"4","key":"28_CR15","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":"4\u20136","key":"28_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(00)00143-5","volume":"76","author":"X Tan","year":"2000","unstructured":"Tan, X.: On optimal bridges between two convex regions. Inf. Process. Lett. 76(4\u20136), 163\u2013168 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"03","key":"28_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218195902000852","volume":"12","author":"X Tan","year":"2002","unstructured":"Tan, X.: Finding an optimal bridge between two polygons. Int. J. Comput. Geom. Appl. 12(03), 249\u2013261 (2002)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2340-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:03:49Z","timestamp":1714691029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2340-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723393","9789819723409"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2340-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tamc2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}