9 citations · 13 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations
Weiyuan Li, Paat Rusmevichientong, Huseyin Topaloglu
When modeling the demand in revenue management systems, a natural approach is to focus on a canonical interval of time, such as a week, so that we forecast the demand over each wee…
Dynamic Service Rate Control for a Single Server Queue with Markov Modulated Arrivals
Ravi Kumar, Mark E. Lewis, Huseyin Topaloglu
We consider the problem of service rate control of a single server queueing system with a finite-state Markov-modulated Poisson arrival process. We show that the optimal service ra…