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 ...

We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) ...

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 ...

Dan Zhang and Larry Weatherford. 2017. Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry. INFORMS Journal on Computing, 29(1): 18-35. Dynamic pricing ...

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.

The Advanced HDR by Technicolor initiative is pushing for a more dynamic, frame-by-frame conversion process powered by ...

Managers using legacy styles of leadership are finding themselves tested in the modern corporate world, defined by rapid changes in technology, intense global competition and unparalleled levels of ...