pages 9152-9166, 2021. URL https://proceedings.neurips.cc/paper/2021/bash/4c4ea5258ef3fb3fb1fc48fee9b4408c-AbsAbstract.html.
Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, and Amit Sahai. Query strategies for priced information (extended abstract). In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 582-591, 2000. doi: 10.1145/335305.335382. URL https://doi.org/10.1145/335305.335382.
Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, and Ruimin Zhang. Pandora's box with correlations: Learning and approximation. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 1214-1225. IEEE, 2020. doi: 10.1109/FOCS46700.2020.00116. URL https://doi.org/10.1109/FOCS46700.2020.00116.
Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, and Christos Tzamos. Approximating Pandora's box with correlations. CoRR, abs/2108.12976, 2021. URL https://arxiv.org/abs/2108.12976.
Yuxin Chen, S. Hamed Hassani, Amin Karbasi, and Andreas Krause. Sequential information maximization: When is greedy near-optimal? In Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015, pages 338-363, 2015a. URL http://proceedings.mlr.press/v40/Chen15b.html.
Yuxin Chen, Shervin Javdani, Amin Karbasi, J. Andrew Bagnell, Siddhartha S. Srinivasa, and Andreas Krause. Submodular surrogates for value of information. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 3511-3518, 2015b. URL http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9841.
Laura Doval. Whether or not to open pandas box. J. Econ. Theory, 175:127-158, 2018. doi: 10.1016/j-jet.2018.01.005. URL https://doi.org/10.1016/j-jet.2018.01.005.
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, and Michael Mitzenmacher. Online Pandora's boxes and bandits. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, pages 1885-1892. AAAI Press, 2019. doi: 10.1609/aaai.v33i01.33011885. URL https://doi.org/10.1609/aaai.v33i01.33011885.
Uriel Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, July 1998. ISSN 0004-5411. doi: 10.1145/285055.285059. URL http://doi.acm.org/10.1145/285055.285059.
Uriel Feige, László Lovász, and Prasad Tetali. Approximating min-sum set cover. In Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pages 94-107, 2002. doi: 10.1007/3-540-45753-4_10. URL https://doi.org/10.1007/3-540-45753-4_10.
Uriel Feige, László Lovász, and Prasad Tetali. Approximating min sum set cover. Algorithmica, 40 (4):219-234, 2004.
Hu Fu, Jiawei Li, and Daogao Liu. Pandora box problem with nonobligatory inspection: Hardness and approximation scheme. In Barna Saha and Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 789-802. ACM, 2023. doi: 10.1145/3564246.3585229. URL https://doi.org/10.1145/3564246.3585229.
Evangelia Gergatsouli and Christos Tzamos. Online learning for min sum set cover and pandas box. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, and Sivan Sabato, editors, International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, volume 162 of Proceedings of Machine Learning Research, pages 7382-7403. PMLR, 2022. URL https://proceedings.mlr.press/v162/gergatsouli22a.html.