Block-successive approximation for a discounted Markov decision model
In this paper 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.
Year of publication: |
1985
|
---|---|
Authors: | Haviv, Moshe |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 19.1985, 1, p. 151-160
|
Publisher: |
Elsevier |
Keywords: | optimal reward Markov decision model partitioning transition matrices successive approximation stationary policies |
Saved in:
Saved in favorites
Similar items by person
-
Consecutive amalgamations and an axiomatization of the Shapley value
Haviv, Moshe, (1995)
-
Queues : a course in queueing theory
Haviv, Moshe, (2013)
-
The price of anarchy in loss systems
Anily, Shoshana, (2021)
- More ...