On polynomial cases of the unichain classification problem for Markov Decision Processes

The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides polynomial algorithms for the unichain classification for an MDP with either a state that is recurrent under all deterministic policies or with a state that is absorbing under some action.

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Eugene A. Feinberg, Fenghsu Yang
• Keywords: Deterministic Policies, ORL 2008, Unichain Classification, Unichain Classification Problem