Inhalt

[ 201WTMSMACU22 ] UE Markov Chains

Versionsauswahl
Workload Education level Study areas Responsible person Hours per week Coordinating university
1,5 ECTS B3 - Bachelor's programme 3. year Mathematics Dmitry Efrosinin 1 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2025W
Learning Outcomes
Competences
Students should have a basic knowledge on probability theory
Skills Knowledge
  • Know basic notions of Markov-Chain with a discrete and continuous time
  • Investigate the properties of Markov-Chains with rewards
  • Derive iterative solution for Markov sequential decision processes
  • Develop the policy-iteration for the solution of optimization problems
  • Apply the policy-iteration algorithm to real-life control problems
  • Understand the main properties of the sequential decision processes with discounting
Calculation of the state probabilities of Markov processes, algorithms of dynamic programming, solution of the optimization problem with the help of Markov decision processes
Criteria for evaluation The evaluation consists of attendance, number of examples ticked and blackboard performance.
Methods Preparation of homework to be presented at the blackboard.
Language English and French
Changing subject? No
Earlier variants They also cover the requirements of the curriculum (from - to)
TM1WCUEMARK: UE Markov chains (2004S-2022S)
On-site course
Maximum number of participants 25
Assignment procedure Direct assignment