PRB shows that item-level coverage, not full optimal-assortment coverage, is sufficient for near-optimal offline MNL assortment optimization, with a claimed matching lower bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning an Optimal Assortment Policy under Observational Data
PRB shows that item-level coverage, not full optimal-assortment coverage, is sufficient for near-optimal offline MNL assortment optimization, with a claimed matching lower bound.