Highly Influential

- Published 2008 in 2008 47th IEEE Conference on Decision and Control
DOI:10.1109/CDC.2008.4739391

The unichain classification problem detects whether an MDP with finite states and actions is unichain or not under all deterministic policies. This problem has been proven to be NP-hard. This paper provides polynomial algorithms for this problem while there exists a state in an MDP, which is either recurrent under all deterministic policies or absorbing… CONTINUE READING

### Presentations referencing similar topics