License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.26
URN: urn:nbn:de:0030-drops-188519
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18851/
Chawla, Shuchi ;
Gergatsouli, Evangelia ;
McMahan, Jeremy ;
Tzamos, Christos
Approximating Pandora’s Box with Correlations
Abstract
We revisit the classic Pandora’s Box (PB) problem under correlated distributions on the box values. Recent work of [Shuchi Chawla et al., 2020] obtained constant approximate algorithms for a restricted class of policies for the problem that visit boxes in a fixed order. In this work, we study the complexity of approximating the optimal policy which may adaptively choose which box to visit next based on the values seen so far.
Our main result establishes an approximation-preserving equivalence of PB to the well studied Uniform Decision Tree (UDT) problem from stochastic optimization and a variant of the Min-Sum Set Cover (MSSC_f) problem. For distributions of support m, UDT admits a log m approximation, and while a constant factor approximation in polynomial time is a long-standing open problem, constant factor approximations are achievable in subexponential time [Ray Li et al., 2020]. Our main result implies that the same properties hold for PB and MSSC_f.
We also study the case where the distribution over values is given more succinctly as a mixture of m product distributions. This problem is again related to a noisy variant of the Optimal Decision Tree which is significantly more challenging. We give a constant-factor approximation that runs in time n^Õ(m²/ε²) when the mixture components on every box are either identical or separated in TV distance by ε.
BibTeX - Entry
@InProceedings{chawla_et_al:LIPIcs.APPROX/RANDOM.2023.26,
author = {Chawla, Shuchi and Gergatsouli, Evangelia and McMahan, Jeremy and Tzamos, Christos},
title = {{Approximating Pandora’s Box with Correlations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {26:1--26:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18851},
URN = {urn:nbn:de:0030-drops-188519},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.26},
annote = {Keywords: Pandora’s Box, Min Sum Set Cover, stochastic optimization, approximation preserving reduction}
}
Keywords: |
|
Pandora’s Box, Min Sum Set Cover, stochastic optimization, approximation preserving reduction |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
04.09.2023 |