The paper solves the stochastic inverse optimal problem. Dynamic programming is used to transform the original problem into a differential equation. Such an equation is well-defined (with probability ...

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 discuss the dynamic programming approach to finding an optimal sequence of a set of tasks when the tasks are related by precedence restrictions. We describe how to use this approach in problems ...

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

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Dynamic Programming and Optimal Control Dynamic Programming and Optimal Control is offered within DMAVT and attracts in excess of 300 students per year from a wide variety of disciplines. It is an ...