Control problems for Markov processes with memory (Q1286309)
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: Control problems for Markov processes with memory |
scientific article; zbMATH DE number 1283629
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Control problems for Markov processes with memory |
scientific article; zbMATH DE number 1283629 |
Statements
Control problems for Markov processes with memory (English)
0 references
2 February 2000
0 references
The authors consider the dynamic programming problem for Markovian random fields. Using the well-known approach from dynamic programming for Markov chains, he shows the existence of an optimal stationary Markovian policy, which may be computed via linear programming.
0 references
dynamic programming
0 references
Markovian random fields
0 references
existence of an optimal stationary Markovian policy
0 references
linear programming
0 references
