1. What contributions have the authors mentioned in the paper "Approximation algorithms for dynamic assortment optimization models" ?
The authors consider the single-period joint assortment and inventory planning problem with stochastic demand and dynamic substitution across products, motivated by applications in highly differentiated markets, such as online retailing and airlines.. In more structured settings, where the customers ’ ranking behavior is motivated by price and quality cues, the authors derive improved guarantees through tailor-made algorithms.. In extensive computational experiments, their approach dominates existing heuristics in terms of revenue performance, as well as in terms of speed, given the myopic nature of their methods.. From a technical perspective, the authors introduce a number of novel algorithmic ideas of independent interest, and unravel hidden relations to submodular maximization.
read more
2. What future works have the authors mentioned in the paper "Approximation algorithms for dynamic assortment optimization models" ?
A natural direction for future research Here, GA designates their general approximation algorithm, SG is their selective-greedy approximation for the nested choice model, DG is the discrete-greedy algorithm, GD is the gradient-descent approach, LS corresponds to the local search heuristic, and GLS is the enumeration-based algorithm of Goyal et al. ( 2016 ).. Is to study newsvendor-like models, where there is no capacity limitation, and instead, the salvage value of inventory has decreasing marginal gains.. It would be interesting to investigate whether the technical ideas the authors developed can be leveraged to this setting.. Following the present work, one open question is that of determining whether the intervals model can be efficiently approximated within a constant factor.
read more
