Algorithms - Open problems
Is there a strongly polynomial algorithm
to compute an optimal policy.
Policy iterations:
1. Non-trivial lower bounds.
2. Better upper bounds.
Relationships to “new” shortest path algorithms
(for episodic MDP).
Previous slide
Next slide
Back to first slide
View graphic version