The many facets of Linear Programming
Here is an extremely nice paper by Michael Todd from 2001. It gives useful background for many lectures and it can serve as a good base point to examine last decade’s progress.
Background post for today’s morning session talks: Is Backgammon in P?
And here is a link to Ye’s paper giving a strongly polynomial algorithm for Markov decision processes with constant discounting. Update: The slides for Ye’s lecture are now posted and they are very detailed and clear.
