Constant-factor approximation for general choice models
Determine whether a constant-factor approximation exists for the joint inventory placement, assortment personalization, and order fulfillment problem under a general customer choice model when a polynomial-time assortment optimization oracle is available, thereby bridging the gap between the paper’s asymptotic approximation results and its constant-factor results for the multinomial logit choice model.
References
To apply the same architecture to another leaf model, intermediate solver iterates must provide valid lower bounds, and those bounds must remain transferable across nested and disjoint samples. We establish these properties for constrained MNL leaves. Whether richer choice models share them remains to be studied.
Second, a significant open question is whether a constant-factor approximation exists for a general choice model under assortment oracle assumption, bridging the gap between our asymptotic results and the MNL case.