In this paper we have provided a general solution to the single-leg revenue management problem which yields the best-possible competitive ratio with limited demand information. Our policies unify the inventory-dependent booking policies in Ball and …
We conduct numerical experiments using dataset Hotel 1 of Bodea et al. (2009). Our numerical setting is a dynamic assortment planning problem, similar to that in Ma and Simchi-Levi (2017), but we consider their extension in which customer purchase p…
We study the multi-armed bandit problem with arms which are Markov chains with rewards. In the finite-horizon setting, the celebrated Gittins indices do not apply, and the exact solution is intractable. We provide approximation algorithms for a more…
Here, we provide a straightforward proof of Theorem 1.7 (Octahedral Sperner with Cubical Labels) via the Brouwer fixed-point theorem. We follow the same standard technique that is typically used in the proof of Sperner’s Lemma [Mat03].
Credentials & highlights
- Project Views