Sciweavers

ORL
2008
68views more  ORL 2008»
13 years 11 months ago
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 p...
Eugene A. Feinberg, Fenghsu Yang