3 papers
math.OC2026
Killing the Case for Randomization in Dynamic Assortment Optimization
Mikhail Fadin, Huseyin Topaloglu
One of the traditional approaches for constructing approximate policies for dynamic assortment optimization problems is to use sampling-based inventory-agnostic policies. Such poli…
math.OC2025
Assortment Optimization under the Multinomial Logit Model with Covering Constraints
Omar El Housni, Qing Feng, Huseyin Topaloglu
We consider an assortment optimization problem under the multinomial logit choice model with general covering constraints. In this problem, the seller offers an assortment that sho…
math.OC2025
Online Allocation of Throughput-Constrained Resources Using Proxy Assignments
Chamsi Hssaine, Huseyin Topaloglu, Garrett van Ryzin
We study a variation of the canonical online resource allocation problem in which resources are throughput, rather than budget, constrained. As in the classical setting, the decisi…