Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...

Methods for planning capacity expansion typically have been restricted to problems with many locations in a static environment or a few locations in a dynamic environment. Two approaches are developed ...

The practice of offering discounts to prospective customers represents a rudimentary form of using transaction history measures to customize the marketing mix. Furthermore, the proliferation of ...

Wang, Franklyn, Ravi Jagadeesan, and Scott Duke Kominers. "Optimizing Reserves in School Choice: A Dynamic Programming Approach." Operations Research Letters 47, no. 5 (September 2019): 438–446.