In 1979, Weitzman introduced Pandora's box problem as a framework for sequential search
with costly inspections. Recently, there has been a surge of interest in Pandora's box …

In delegation problems, a principal does not have the resources necessary to complete a
particular task, so they delegate the task to an untrusted agent whose interests may differ …

In recent years there has been a significant research effort on incorporating predictions into
online algorithms. However, work in this area often makes the underlying assumption that …

Our main contribution is a general framework to design efficient polynomial time
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …

With a wide range of applications, stochastic matching problems have been studied in
different models, including prophet inequality, Query-Commit, and Price-of-Information …

We develop a framework for designing simple and efficient policies for a family of online
allocation and pricing problems that includes online packing, budget-constrained probing …

Abstract The Prophet Inequality and Pandora's Box problems are fundamental stochastic
problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization …

We study how to utilize (possibly erroneous) predictions in a model for computing under
uncertainty in which an algorithm can query unknown data. Our aim is to minimize the …

The Pandora's Box problem and its extensions capture optimization problems with
stochastic input where the algorithm can obtain instantiations of input random variables at …

The problem of scheduling with testing in the framework of explorable uncertainty models
environments where some preliminary action can influence the duration of a task. In the …