{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:34:14Z","timestamp":1767321254132,"version":"3.48.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:27Z","timestamp":1767320967000},"page":"61-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matching with\u00a0Nested and\u00a0Bundled Pandora Boxes"],"prefix":"10.1007","author":[{"given":"Robin","family":"Bowers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Waggoner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aouad, A., Ji, J., Shaposhnik, Y.: The pandora\u2019s box problem with sequential inspections. Journal SSRN 3726167 (2020)","DOI":"10.2139\/ssrn.3726167"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Braverman, M., Kanoria, Y., Shi, P.: Clearing matching markets efficiently: informative signals and match recommendations. Manag. Sci. 665, 2163\u20132193 (2020)","DOI":"10.1287\/mnsc.2018.3265"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Beyhaghi, H., Cai, L.: Pandora\u2019s problem with nonobligatory inspection: optimal structure and a PTAS. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023). Association for Computing Machinery, pp. 803\u2013816 (2023)","DOI":"10.1145\/3564246.3585217"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Beyhaghi, H and Cai, L.: Recent developments in the pandora\u2019s box problem: variants and applications. SIGecom Exchanges 21, 1 (2023)","DOI":"10.1145\/3699814.3699817"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Beyhaghi, H., Kleinberg, R.: Pandora\u2019s problem with nonobligatory inspection. In: Proceedings of the 2019 ACM Conference on Economics and Computation (EC 2019). Association for Computing Machinery, 131\u2013132 (2019)","DOI":"10.1145\/3328526.3329626"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Boodaghians, S., Fusco, F., Lazos, P., Leonardi, S.: Pandora\u2019s box problem with order constraints (EC 2020). Assoc. Comput. Mach., 439\u2013458 (2020)","DOI":"10.1145\/3391403.3399501"},{"key":"4_CR7","first-page":"59","volume-title":"Web and Internet Economics, Jugal Garg, Max Klimm, and Yuqing Kong","author":"R Bowers","year":"2024","unstructured":"Bowers, R., Waggoner, B.: High-welfare matching markets via descending price. In: Nature, S. (ed.) Web and Internet Economics, Jugal Garg, Max Klimm, and Yuqing Kong, pp. 59\u201376. Switzerland, Cham (2024)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chade, H., Eeckhout, J., Smith, L.: Sorting through search and matching models in economics. J. Econ. Literature 55(2), 493\u2013544 (2017)","DOI":"10.1257\/jel.20150777"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Gergatsouli, E., Teng, Y., Tzamos, C., Zhang, R.: Pandora\u2019s box with correlations: Learning and approximation. In: IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1214\u20131225. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00116"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Doval, L.: Whether or not to open Pandora\u2019s box. J. Econ. Theory 175, 127\u2013158 (2018)","DOI":"10.1016\/j.jet.2018.01.005"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fu, H., Li, J., Liu, D.: Pandora box problem with nonobligatory inspection: hardness and approximation scheme. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 789\u2013802 (2023)","DOI":"10.1145\/3564246.3585229"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gittins, J.C.: Bandit processes and dynamic allocation indices. J. Royal Stat. Soc. Seri. B (Methodol.) 41(2), 148\u2013177 (1979)","DOI":"10.1111\/j.2517-6161.1979.tb01068.x"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-030-17953-3_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Gupta","year":"2019","unstructured":"Gupta, A., Jiang, H., Scully, Z., Singla, S.: The Markovian Price of Information. In: Lodi, A., Nagarajan, V. (eds.) IPCO 2019. LNCS, vol. 11480, pp. 233\u2013246. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_18"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Hakimov, R., K\u00fcbler, D., Pan, S.: Costly information acquisition in centralized matching markets. Quan. Econ. 14(4), 1447\u20131490 (2023)","DOI":"10.3982\/QE1955"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Leshno, J., Lo, I., Lucier, B.: Information acquisition in matching markets: the role of price discovery. Available at SSRN 3705049 (2020)","DOI":"10.2139\/ssrn.3705049"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Lucier, B., Manshadi, V.H., Wei, L.: Designing approximately optimal search on matching platforms. In: Proceedings of the 2021 ACM Conference on Economics and Computation (EC 2021), P\u00e9ter Bir\u00f3, Shuchi Chawla, and Federico Echenique (Eds.). Association for Computing Machinery, pp. 632\u2013633 (2021)","DOI":"10.1145\/3465456.3467530"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Tony Ke, T.,\u00a0Miguel Villas-Boas, J.: Optimal learning before choice. J. Econ. Theory 180, 383\u2013437 (2019)","DOI":"10.1016\/j.jet.2019.01.005"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Waggoner, B., Weyl, E.G.: Descending price optimally coordinates search. In: Proceedings of the 2016 ACM Conference on Economics and Computation (EC 2016). Association for Computing Machinery, pp. 23\u201324 (2016)","DOI":"10.1145\/2940716.2940760"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Singla, S.: The price of information in combinatorial optimization. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, pp. 2523\u20132532 (2018)","DOI":"10.1137\/1.9781611975031.161"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Waggoner, B., Weyl, E.G.: Matching markets via descending price. Available at SSRN 3373934 (2019)","DOI":"10.2139\/ssrn.3373934"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641\u2013654","DOI":"10.2307\/1910412"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08560-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:29Z","timestamp":1767320969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}