Thus far we have considered finite time Markov decision processes. We now want to solve MDPs of the form
Markov decision processes are essentially the randomized equivalent of a dynamic program.
We briefly explain the principles behind dynamic programming and then give its definition.
The link below contains notes PDF for this years stochastic control course
I’ll upload individual posts for each section. I’ll likely update these notes and add more exercises over the coming semester. I’ll add this update in a further post at the end of the course. Comments, typos, suggestions are always welcome.
Here is a quick request for comments for Probability 1 students. Here are two answers saying that the probability that a grandfather, father and son are all born on the same day.
The first answer is sort of wrong because it assumes you specify in advance date of birth. The second answer is right because we assume in advance we are given three generations and we assume we deal with a first born son.
Please leave comments below and will forward them on to BBC.
Because I heard a few students had not come across some mathematical notation. Here is a quick introduction to a few mathematical terms.