{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T09:45:41Z","timestamp":1768729541224,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF-BSF","award":["2020788"],"award-info":[{"award-number":["2020788"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["866132"],"award-info":[{"award-number":["866132"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["788893"],"award-info":[{"award-number":["788893"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["PE0000013-FAIR"],"award-info":[{"award-number":["PE0000013-FAIR"]}]},{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["IR0000013-SoBigData.it"],"award-info":[{"award-number":["IR0000013-SoBigData.it"]}]},{"name":"Ministero dell?Istruzione, dell?Universit\u00e0 e della Ricerca","award":["ALGADIMAR"],"award-info":[{"award-number":["ALGADIMAR"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597699","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"273-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Pandora's Problem with Combinatorial Cost"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9115-6160","authenticated-orcid":false,"given":"Ben","family":"Berger","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0626-4851","authenticated-orcid":false,"given":"Tomer","family":"Ezra","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2915-8405","authenticated-orcid":false,"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6250-945X","authenticated-orcid":false,"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Saeed Alaei Ali Makhdoumi and Azarakhsh Malekian. 2021. Revenue Maximization Under Unknown Private Values With Non-Obligatory Inspection. In EC. ACM 27--28.  Saeed Alaei Ali Makhdoumi and Azarakhsh Malekian. 2021. Revenue Maximization Under Unknown Private Values With Non-Obligatory Inspection. In EC. ACM 27--28.","DOI":"10.2139\/ssrn.3855810"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Curtis Bechtel Shaddin Dughmi and Neel Patel. 2022. Delegated Pandora's Box. In EC. ACM 666--693.  Curtis Bechtel Shaddin Dughmi and Neel Patel. 2022. Delegated Pandora's Box. In EC. ACM 666--693.","DOI":"10.1145\/3490486.3538267"},{"key":"e_1_3_2_1_3_1","volume-title":"Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. To appear in STOC","author":"Beyhaghi Hedyeh","year":"2023","unstructured":"Hedyeh Beyhaghi and Linda Cai . 2022. Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. To appear in STOC 2023 , preprint on the arXiv abs\/2212.01524 (2022). Hedyeh Beyhaghi and Linda Cai. 2022. Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. To appear in STOC 2023, preprint on the arXiv abs\/2212.01524 (2022)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Hedyeh Beyhaghi and Robert Kleinberg. 2019. Pandora's Problem with Nonobligatory Inspection. In EC. ACM 131--132.  Hedyeh Beyhaghi and Robert Kleinberg. 2019. Pandora's Problem with Nonobligatory Inspection. In EC. ACM 131--132.","DOI":"10.1145\/3328526.3329626"},{"key":"e_1_3_2_1_5_1","volume-title":"Algorithmic game theory","author":"Blumrosen Liad","unstructured":"Liad Blumrosen and Noam Nisan . 2007. Algorithmic game theory . Cambridge University Press , New York, USA. Liad Blumrosen and Noam Nisan. 2007. Algorithmic game theory. Cambridge University Press, New York, USA."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Shant Boodaghians Federico Fusco Philip Lazos and Stefano Leonardi. 2020. Pandora's Box Problem with Order Constraints. In EC. ACM 439--458.  Shant Boodaghians Federico Fusco Philip Lazos and Stefano Leonardi. 2020. Pandora's Box Problem with Order Constraints. In EC. ACM 439--458.","DOI":"10.1145\/3391403.3399501"},{"key":"e_1_3_2_1_7_1","volume-title":"Approximating Pandora's Box with Correlations. CoRR abs\/2108.12976","author":"Chawla Shuchi","year":"2021","unstructured":"Shuchi Chawla , Evangelia Gergatsouli , Jeremy McMahan , and Christos Tzamos . 2021. Approximating Pandora's Box with Correlations. CoRR abs\/2108.12976 ( 2021 ). Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, and Christos Tzamos. 2021. Approximating Pandora's Box with Correlations. CoRR abs\/2108.12976 (2021)."},{"key":"e_1_3_2_1_8_1","volume-title":"Pandora's Box with Correlations: Learning and Approximation","author":"Chawla Shuchi","unstructured":"Shuchi Chawla , Evangelia Gergatsouli , Yifeng Teng , Christos Tzamos , and Ruimin Zhang . 2020. Pandora's Box with Correlations: Learning and Approximation . In FOCS. IEEE , 1214--1225. Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, and Ruimin Zhang. 2020. Pandora's Box with Correlations: Learning and Approximation. In FOCS. IEEE, 1214--1225."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2018.01.005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102408341"},{"key":"e_1_3_2_1_11_1","volume-title":"Brendan Lucier, and Michael Mitzenmacher.","author":"Esfandiari Hossein","year":"2019","unstructured":"Hossein Esfandiari , Mohammad Taghi Hajiaghayi , Brendan Lucier, and Michael Mitzenmacher. 2019 . Online Pandora's Boxes and Bandits. In AAAI. AAAI Press , 1885--1892. Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, and Michael Mitzenmacher. 2019. Online Pandora's Boxes and Bandits. In AAAI. AAAI Press, 1885--1892."},{"key":"e_1_3_2_1_12_1","volume-title":"Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme. To appear in STOC","author":"Fu Hu","year":"2023","unstructured":"Hu Fu , Jiawei Li , and Daogao Liu . 2022. Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme. To appear in STOC 2023 , preprint on the arXiv abs\/2207.09545v2 (2022). Hu Fu, Jiawei Li, and Daogao Liu. 2022. Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme. To appear in STOC 2023, preprint on the arXiv abs\/2207.09545v2 (2022)."},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"A PTAS for a Class of Stochastic Dynamic Programs. In ICALP (LIPIcs, Vol. 107)","volume":"56","author":"Fu Hao","year":"2018","unstructured":"Hao Fu , Jian Li , and Pan Xu . 2018 . A PTAS for a Class of Stochastic Dynamic Programs. In ICALP (LIPIcs, Vol. 107) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 56 : 1 -- 56 :14. Hao Fu, Jian Li, and Pan Xu. 2018. A PTAS for a Class of Stochastic Dynamic Programs. In ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 56:1--56:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_14_1","volume-title":"Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR abs\/2211.08586","author":"Gatmiry Khashayar","year":"2022","unstructured":"Khashayar Gatmiry , Thomas Kesselheim , Sahil Singla , and Yifan Wang . 2022. Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR abs\/2211.08586 ( 2022 ). Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, and Yifan Wang. 2022. Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR abs\/2211.08586 (2022)."},{"key":"e_1_3_2_1_15_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"7403","author":"Gergatsouli Evangelia","year":"2022","unstructured":"Evangelia Gergatsouli and Christos Tzamos . 2022 . Online Learning for Min Sum Set Cover and Pandora's Box . In ICML (Proceedings of Machine Learning Research , Vol. 162). PMLR, 7382-- 7403 . Evangelia Gergatsouli and Christos Tzamos. 2022. Online Learning for Min Sum Set Cover and Pandora's Box. In ICML (Proceedings of Machine Learning Research, Vol. 162). PMLR, 7382--7403."},{"key":"e_1_3_2_1_16_1","volume-title":"Zhihao Gavin Tang, and Xinzhi Zhang","author":"Guo Chenghao","year":"2021","unstructured":"Chenghao Guo , Zhiyi Huang , Zhihao Gavin Tang, and Xinzhi Zhang . 2021 . Generalizing Complex Hypotheses on Product Distributions : Auctions, Prophet Inequalities, and Pandora's Problem. In COLT (Proceedings of Machine Learning Research , Vol. 134). PMLR, 2248-- 2288 . Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, and Xinzhi Zhang. 2021. Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. In COLT (Proceedings of Machine Learning Research, Vol. 134). PMLR, 2248--2288."},{"key":"e_1_3_2_1_17_1","volume-title":"Kleinberg and Robert Kleinberg","author":"Jon","year":"2018","unstructured":"Jon M. Kleinberg and Robert Kleinberg . 2018 . Delegated Search Approximates Efficient Search. In EC. ACM , 287--302. Jon M. Kleinberg and Robert Kleinberg. 2018. Delegated Search Approximates Efficient Search. In EC. ACM, 287--302."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Robert D. Kleinberg Bo Waggoner and E. Glen Weyl. 2016. Descending Price Optimally Coordinates Search. In EC. ACM 23--24.  Robert D. Kleinberg Bo Waggoner and E. Glen Weyl. 2016. Descending Price Optimally Coordinates Search. In EC. ACM 23--24.","DOI":"10.1145\/2940716.2940760"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.02.006"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2015.10.009"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Danny Segev and Sahil Singla. 2021. Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. In EC. ACM 793--794.  Danny Segev and Sahil Singla. 2021. Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. In EC. ACM 793--794.","DOI":"10.1145\/3465456.3467614"},{"key":"e_1_3_2_1_22_1","volume-title":"The Price of Information in Combinatorial Optimization","author":"Singla Sahil","unstructured":"Sahil Singla . 2018. The Price of Information in Combinatorial Optimization . In SODA. SIAM , 2523--2532. Sahil Singla. 2018. The Price of Information in Combinatorial Optimization. In SODA. SIAM, 2523--2532."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005588"},{"key":"e_1_3_2_1_25_1","volume-title":"Optimal search for the best alternative. Econometrica: Journal of the Econometric Society","author":"Weitzman Martin L","year":"1979","unstructured":"Martin L Weitzman . 1979. Optimal search for the best alternative. Econometrica: Journal of the Econometric Society ( 1979 ), 641--654. Martin L Weitzman. 1979. Optimal search for the best alternative. Econometrica: Journal of the Econometric Society (1979), 641--654."}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","location":"London United Kingdom","acronym":"EC '23","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":25,"alternative-id":["10.1145\/3580507.3597699","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597699","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}