Combinatorial Markov Search
Published in Symposium on Theory of Computing, 2026
We explore an extension of the Pandora’s box problem where each box is modeled as an MDP. We obtain a constant-factor approximation using a Prophet Inequality-style algorithm that considers boxes one at a time.
Recommended citation: Bowers, Robin, Elias Lindgren, and Bo Waggoner. "Combinatorial Markov Search." Symposium on Theory of Computing, 2026, https://arxiv.org/abs/2502.08976.
Download Paper
