Using Randomization to Break the Curse of Dimensionality
This paper introduces random versions of successive approximations and multigrid algorithms for computing approximate solutions to a class of finite and infinite horizon Markovian decision problems. The author proves that these algorithms succeed in breaking the 'curse of dimensionality' for a subclass of Markovian decision problems known as discrete decision processes.
Year of publication: |
1997
|
---|---|
Authors: | Rust, John |
Published in: |
Econometrica. - Econometric Society. - Vol. 65.1997, 3, p. 487-516
|
Publisher: |
Econometric Society |
Saved in:
Saved in favorites
Similar items by person
-
Time Inconsistency in the Credit Card Market
shui, haiyan, (2004)
-
Is It More Profitable to Post Prices? - Market Structure with Endogeneous Search Costs
Gong, Binglin, (2006)
-
ESSAYS ON DEMOGRAPHIC ISSUES IN CHINA
Li, Xue, (2011)
- More ...