Derandomization algorithm for sampling-based policies in dynamic assortment optimization plus a 1/2-epsilon performance guarantee for locally optimal deterministic policies.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Killing the Case for Randomization in Dynamic Assortment Optimization
Derandomization algorithm for sampling-based policies in dynamic assortment optimization plus a 1/2-epsilon performance guarantee for locally optimal deterministic policies.