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

Authors:
Eugene A. Feinberg;Fenghsu Yang
Affiliations:
Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY 11794-3600, United States;Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY 11794-3600, United States
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 1

Finite State Markovian Decision Processes

Finite State Markovian Decision Processes
NP-Hardness of checking the unichain condition in average cost MDPs

Operations Research Letters

Dynamic Power Management for Sensor Node in WSN Using Average Reward MDP

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard. This paper provides polynomial algorithms for this problem when there is a state that is either recurrent under all deterministic policies or absorbing under some action.