Blogs

1. AI-assisted Results for Assortment Optimization

1. A Polynomial-Time Approximation Scheme for Assortment Optimization under the Mallows Model, see here, to be verified.

TL;DR: We provide a deterministic PTAS for assortment optimization under the Mallows choice model. The algorithm keeps the first $O(1/\varepsilon)$ offered items, compresses the tail into two rounded weight aggregates, and runs a longest-path DP.