Recent developments in pandora's box problem: Variants and applications
H Beyhaghi, L Cai - arXiv preprint arXiv:2308.12242, 2023 - arxiv.org
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 …
with costly inspections. Recently, there has been a surge of interest in Pandora's box …
Delegated 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 …
particular task, so they delegate the task to an untrusted agent whose interests may differ …
Online algorithms with costly predictions
M Drygala, SG Nagarajan… - … Conference on Artificial …, 2023 - proceedings.mlr.press
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 …
online algorithms. However, work in this area often makes the underlying assumption that …
Efficient approximation schemes for stochastic probing and prophet problems
D Segev, S Singla - Proceedings of the 22nd ACM Conference on …, 2021 - dl.acm.org
Our main contribution is a general framework to design efficient polynomial time
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …
Random order vertex arrival contention resolution schemes for matching, with applications
With a wide range of applications, stochastic matching problems have been studied in
different models, including prophet inequality, Query-Commit, and Price-of-Information …
different models, including prophet inequality, Query-Commit, and Price-of-Information …
Online allocation and pricing: Constant regret via bellman inequalities
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 …
allocation and pricing problems that includes online packing, budget-constrained probing …
Bandit Algorithms for Prophet Inequality and Pandora's Box
Abstract The Prophet Inequality and Pandora's Box problems are fundamental stochastic
problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization …
problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization …
Learning-augmented query policies for minimum spanning tree with uncertainty
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 …
uncertainty in which an algorithm can query unknown data. Our aim is to minimize the …
Pandora's box with correlations: Learning and approximation
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 …
stochastic input where the algorithm can obtain instantiations of input random variables at …
[HTML][HTML] Explorable uncertainty in scheduling with non-uniform testing times
S Albers, A Eckl - … and Online Algorithms: 18th International Workshop …, 2021 - Springer
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 …
environments where some preliminary action can influence the duration of a task. In the …