In addition to a plain-vanilla implementation of dynamic programming decomposition, we consider the variants proposed by Erdelyi and Topaloglu (2011) and Zhang (2011). For the base scenario generated ...

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

A. L. Stoecker, A. Seidmann, G. S. Lloyd, A Linear Dynamic Programming Approach to Irrigation System Management with Depleting Groundwater, Management Science, Vol ...

This makes our approach practical for real-world problems in which this latter number is small. More importantly, the algorithm offers savings in computational effort as compared to the classical ...