Abstract
An optimal strategy in a Markov decision problem is robust if it is optimal in every decision problem (not necessarily stationary) that is close to the original problem. We prove that when the state and action spaces are finite, an optimal strategy is robust if and only if it is the unique optimal strategy.
Original language | English |
---|---|
Pages (from-to) | 109-112 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 42 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2014 |
Keywords
- Markov decision problems
- Optimal strategy
- Robustness
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics