Communicating MDPs: Equivalence and LP properties (Q1112741)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Communicating MDPs: Equivalence and LP properties |
scientific article; zbMATH DE number 4079195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communicating MDPs: Equivalence and LP properties |
scientific article; zbMATH DE number 4079195 |
Statements
Communicating MDPs: Equivalence and LP properties (English)
0 references
1988
0 references
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.
0 references
irreducible Markov chain
0 references
