{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:25:37Z","timestamp":1767320737908,"version":"3.48.0"},"publisher-location":"Cham","reference-count":29,"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_28","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:11Z","timestamp":1767320591000},"page":"494-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pandora\u2019s Box Problem Over Time"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Amanatidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rebecca","family":"Reiffenh\u00e4user","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artem","family":"Tsikiridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Sethuraman, J., Zhang, X.: On optimal ordering in the optimal stopping problem. In: EC, pp. 187\u2013188. ACM (2020)","DOI":"10.1145\/3391403.3399484"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Atsidakou, A., Caramanis, C., Gergatsouli, E., Papadigenopoulos, O., Tzamos, C.: Contextual Pandora\u2019s box. In: AAAI, pp. 10944\u201310952. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i10.28969"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Berger, B., Ezra, T., Feldman, M., Fusco, F.: Pandora\u2019s problem with combinatorial cost. In: EC, pp. 273\u2013292. ACM (2023)","DOI":"10.1145\/3580507.3597699"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Berger, B., Ezra, T., Feldman, M., Fusco, F.: Pandora\u2019s problem with deadlines. In: AAAI, pp. 20337\u201320343. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i18.30015"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Beyhaghi, H., Cai, L.: Pandora\u2019s problem with nonobligatory inspection: optimal structure and a PTAS. In: STOC, pp. 803\u2013816. ACM (2023)","DOI":"10.1145\/3564246.3585217"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/3699814.3699817","volume":"21","author":"H Beyhaghi","year":"2023","unstructured":"Beyhaghi, H., Cai, L.: Recent developments in Pandora\u2019s box problem: variants and applications. SIGecom Exch. 21(1), 20\u201334 (2023)","journal-title":"SIGecom Exch."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Beyhaghi, H., Kleinberg, R.: Pandora\u2019s problem with nonobligatory inspection. In: EC, pp. 131\u2013132. ACM (2019)","DOI":"10.1145\/3328526.3329626"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/moor.2022.1271","volume":"48","author":"S Boodaghians","year":"2023","unstructured":"Boodaghians, S., Fusco, F., Lazos, P., Leonardi, S.: Pandora\u2019s box problem with order constraints. Math. Oper. Res. 48(1), 498\u2013519 (2023)","journal-title":"Math. Oper. Res."},{"key":"28_CR9","unstructured":"Bradac, D., Singla, S., Zuzic, G.: (Near) optimal adaptivity gaps for stochastic multi-value probing. In: APPROX-RANDOM. LIPIcs, vol.\u00a0145, pp. 49:1\u201349:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Bubna, A., Chiplunkar, A.: Prophet inequality: Order selection beats random order. In: EC, pp. 302\u2013336. ACM (2023)","DOI":"10.1145\/3580507.3597687"},{"key":"28_CR11","unstructured":"Chawla, S., Gergatsouli, E., McMahan, J., Tzamos, C.: Approximating Pandora\u2019s box with correlations. In: APPROX\/RANDOM. LIPIcs, vol.\u00a0275, pp. 26:1\u201326:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Chawla, S., Gergatsouli, E., Teng, Y., Tzamos, C., Zhang, R.: Pandora\u2019s box with correlations: learning and approximation. In: FOCS, pp. 1214\u20131225. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00116"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jet.2018.01.005","volume":"175","author":"L Doval","year":"2018","unstructured":"Doval, L.: Whether or not to open Pandora\u2019s box. J. Econ. Theory 175, 127\u2013158 (2018)","journal-title":"J. Econ. Theory"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Esfandiari, H., Hajiaghayi, M.T., Lucier, B., Mitzenmacher, M.: Online Pandora\u2019s boxes and bandits. In: AAAI, pp. 1885\u20131892. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011885"},{"key":"28_CR15","unstructured":"Fu, H., Li, J., Xu, P.: A PTAS for a class of stochastic dynamic programs. In: ICALP. LIPIcs, vol.\u00a0107, pp. 56:1\u201356:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Fu, H., Li, J., Liu, D.: Pandora box problem with nonobligatory inspection: hardness and approximation scheme. In: STOC, pp. 789\u2013802. ACM (2023)","DOI":"10.1145\/3564246.3585229"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Gatmiry, K., Kesselheim, T., Singla, S., Wang, Y.: Bandit algorithms for prophet inequality and Pandora\u2019s box. In: SODA, pp. 462\u2013500. SIAM (2024)","DOI":"10.1137\/1.9781611977912.18"},{"key":"28_CR18","unstructured":"Gergatsouli, E., Tzamos, C.: Online learning for min sum set cover and Pandora\u2019s box. In: ICML. Proceedings of Machine Learning Research, vol.\u00a0162, pp. 7382\u20137403. PMLR (2022)"},{"key":"28_CR19","unstructured":"Guo, C., Huang, Z., Tang, Z.G., Zhang, X.: Generalizing complex hypotheses on product distributions: auctions, prophet inequalities, and Pandora\u2019s problem. In: COLT. Proceedings of Machine Learning Research, vol.\u00a0134, pp. 2248\u20132288. PMLR (2021)"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1090\/S0002-9939-1983-0691293-4","volume":"88","author":"T Hill","year":"1983","unstructured":"Hill, T.: Prophet inequalities and order selection in optimal stopping problems. Proc. Am. Math. Soc. 88(1), 131\u2013137 (1983)","journal-title":"Proc. Am. Math. Soc."},{"key":"28_CR21","unstructured":"Hoefer, M., Schecker, C., Schewior, K.: Contract design for Pandora\u2019s box. CoRR abs\/2403.02317 (2024)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: STOC, pp. 123\u2013136. ACM (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.D., Waggoner, B., Weyl, E.G.: Descending price optimally coordinates search. In: EC, pp. 23\u201324. ACM (2016)","DOI":"10.1145\/2940716.2940760"},{"issue":"4","key":"28_CR24","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.jet.2015.10.009","volume":"160","author":"W Olszewski","year":"2015","unstructured":"Olszewski, W., Weber, R.: A more general Pandora rule? J. Econ. Theory 160, 429\u2013437 (2015)","journal-title":"J. Econ. Theory"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 1213\u20131216 (1984)","DOI":"10.1214\/aop\/1176993150"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Segev, D., Singla, S.: Efficient approximation schemes for stochastic probing and prophet problems. In: EC, pp. 793\u2013794. ACM (2021)","DOI":"10.1145\/3465456.3467614"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Singla, S.: The price of information in combinatorial optimization. In: SODA, pp. 2523\u20132532. SIAM (2018)","DOI":"10.1137\/1.9781611975031.161"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Weitzman, M.L.: Optimal search for the best alternative. Econometrica: J. Econometric Soc. 641\u2013654 (1979)","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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:13Z","timestamp":1767320593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_28","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"}}]}}