Communicating MDPs: Equivalence and LP properties
The communicating property of Markov decision processes (MDP) is equivalent to the satisfaction of sets of linear equations. A mapping between ``multichain'' and ``unchain'' linear programs for undiscounted MDPs developed by using this equivalence is used to show that the simplex linear program solves communicating MDPs.
scientific article; zbMATH DE number 4079195