| Article ID: | iaor1988747 |
| Country: | Netherlands |
| Volume: | 7 |
| Issue: | 6 |
| Start Page Number: | 303 |
| End Page Number: | 307 |
| Publication Date: | Dec 1988 |
| Journal: | Operations Research Letters |
| Authors: | Filar Jerzy A., Schultz Todd A. |
It is shown that the communicating property of Markov Decision Processes (MDPs) is equivalent to satisfaction of sets of linear equations. A mapping between the ‘multichain’ and ‘unichain’ linear programs for undiscounted MDPs is developed by applying this equivalence. The mapping is used to prove that the simpler linear program solves communicating MDPs.