Lecture

Infinite-Horizon Problems: Formulation & Complexity

In course

Eu magna sint aute mollit occaecat. Ullamco fugiat in consequat excepteur est id deserunt cillum sunt elit qui voluptate. Ullamco consequat est minim aute ad cupidatat incididunt culpa.

Description

This lecture covers infinite-horizon problems in Applied Probability and Stochastic Processes, focusing on the formulation and algorithm complexity. It discusses a two-state discounted Markov decision process and explores the policy iteration algorithm to find an optimal policy.

Official source

https://mediaspace.epfl.ch/media/0_f3u21sqs

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

: ,

Related lectures (83)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.