Risk-Sensitive Online Selection with Bounded Adaptivity
Hossein Nekouyan, Bo Sun, Raouf Boutaba, Xiaoqi Tan

TL;DR
This paper introduces a correlated pricing mechanism for online resource allocation that improves tail-risk performance under adaptivity constraints, with theoretical guarantees and real-data experiments.
Contribution
It proposes a novel correlated posted-price mechanism using a single seed to control tail risk while respecting adaptivity limits in online decision-making.
Findings
Correlation improves lower-tail performance in online algorithms.
The framework balances risk sensitivity, adaptivity, and competitive guarantees.
Experiments show correlated pricing reduces tail risk in airline data.
Abstract
Designing randomized online algorithms that perform reliably not only in expectation but also under unfavorable realizations of randomness is a fundamental challenge in online decision-making. In this paper, we study this challenge in online adversarial selection, where a decision maker allocates units of a resource to sequentially arriving buyers through posted prices. We focus on two intertwined considerations that are often overlooked simultaneously: tail-risk sensitivity and bounded adaptivity, where tail risk is measured using conditional value-at-risk (CVaR) and bounded adaptivity limits the number of allowable policy updates over time. Our main contribution is a correlated posted-price mechanism that uses a single random seed to coordinate pricing decisions across time. This correlation induces a monotonic ordering of pricing profiles across sample paths, improving lower-tail…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
