SearcharxivSearch

arXiv · 2605.19181

Risk of Bad Tails: CVaR-Aware Pandora's Box and Prophet Inequalities

Abstract

We study Conditional Value-at-Risk (CVaR) variants of two canonical sequential decision problems: Pandora's box and the prophet inequality. For Pandora's box, the risk-aware problem retains an elegant Weitzman-style index solution after a one-dimensional variational reduction. For the prophet inequality, the picture is different: for every CVaR level \(\alpha\in(0,1)\), no positive constant approximation guarantee can hold without additional distributional structure, in sharp contrast with the risk-neutral case \(\alpha=1\), and we characterize the tight instance-dependent guarantee. Already in two-item hard instances, the prophet's CVaR benchmark can be made arbitrarily large while every online policy's CVaR remains relatively bounded. This impossibility is due to the nature of CVaR objective: it measures only the worst \(\alpha\)-fraction of outcomes, so any compromise an online policy makes to preserve the chance of a large payoff in the upper \((1-\alpha)\)-fraction might not help its CVaR. It turns out that some additional distributional structure restores a uniform result: under continuous reward distributions satisfying an increasing-failure-rate-average (IFRA) condition, a threshold policy achieves an explicit constant bound.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jingwei Ji. 2026-05-18. Risk of Bad Tails: CVaR-Aware Pandora's Box and Prophet Inequalities. https://arxiv.org/abs/2605.19181

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC