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

A dynamic programming approach is proposed to select optimally among a given set of products and allocate integer shelf-space units to the selected products in supermarkets. The approach is designed ...

Dan A. Iancu, Mayank Sharma, Maxim Sviridenko, Supermodularity and Affine Policies in Dynamic Robust Optimization, Operations Research, Vol. 61, No. 4 (July-August 2013), pp. 941-956 ...

We introduce a new model of school choice with reserves in which a social planner is constrained by a limited supply of reserve seats and tries to find an optimal matching according to a social ...