Markov Decision Processes
Course Description
Formulation and solution of sequential decision problems under uncertainty as a foundation for artificial intelligence, operations research, and economics. Finite-horizon, discounted, and average reward objectives. Optimization via value iteration, policy iteration, linear programming, and reinforcement learning algorithms. Semi-Markov decision processes. Multi-armed bandits and the Gittin's index theorem. Use of partial state information. Homework assignments involve a combination of analytic and computational exercises.
MS&E 235A
Units: 3
See When It's Offered opens a new window opens in a new tab
Typically Offered
Not Available
Grading Basis
Letter or Credit/No Credit
Class Level
Graduate
Instructional Mode
In Person
Gen Ed Requirement(s)
None
