Block-successive approximation for a discounted Markov decision model (Q2265958): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-4149(85)90046-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080054160 / rank | |||
Normal rank |
Revision as of 23:32, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Block-successive approximation for a discounted Markov decision model |
scientific article |
Statements
Block-successive approximation for a discounted Markov decision model (English)
0 references
1985
0 references
We suggest a new successive approximation method to compute the optimal discounted reward for finite state and action, discrete time, discounted Markov decision chains. The method is based on a block partitioning of the (stochastic) matrices corresponding to the stationary policies. The method is particularly attractive when the transition matrices are jointly nearly decomposable or nearly completely decomposable.
0 references
successive approximation
0 references
optimal discounted reward
0 references
finite state and action, discrete time, discounted Markov decision chains
0 references
block partitioning
0 references
stationary policies
0 references