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

The first is an approximate approach based on an equivalent annual cost measure, and the second is a procedure for systematic improvement of the approximate solution. The method for improvement is ...

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