This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...

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

Daniel R. Jiang, Warren B. Powell, An Approximate Dynamic Programming Algorithm for Monotone Value Functions, Operations Research, Vol. 63, No. 6 (November-December 2015), pp. 1489-1511 ...