Simulation-based Algorithms for Markov Decision Processes

✍ Scribed by Hyeong Soo Chang, Michael C. Fu, Jiaqiao Hu, Steven I. Marcus

• Publisher: Springer
• Year: 2007
• Tongue: English
• Leaves: 202
• Series: Communications and Control Engineering
• Edition: 1st Edition.
• Category: Library

✦ Synopsis

Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. It is well-known that many real-world problems modeled by MDPs have huge state and/or action spaces, leading to the notorious curse of dimensionality that makes practical solution of the resulting models intractable. In other cases, the system of interest is complex enough that it is not feasible to specify some of the MDP model parameters explicitly, but simulation samples are readily available (e.g., for random transitions and costs). For these settings, various sampling and population-based numerical algorithms have been developed recently to overcome the difficulties of computing an optimal solution in terms of a policy and/or value function.