Using Randomization to Break the Curse of Dimensionality

John Rust (), Department of Economics and University of Wisconsin

Computational Economics from EconWPA

Abstract: 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 (MDPs). We prove that these algorithms succeed in breaking the curse of dimensionality for a subclass of MDPs known as discrete decision processes (DDPs).

JEL-codes: C8 (search for similar items in EconPapers)
Date: Written 1994-03-29
Note: TeX file, Postscript version submitted
View list of references

Downloads: (external link)
http://129.3.20.41/eps/comp/papers/9403/9403001.pdf (application/pdf)
http://129.3.20.41/eps/comp/papers/9403/9403001.ps.gz (application/postscript)

Related works:
Working Paper: Using Randomization to Break the Curse of Dimensionality (1994)
Journal Article: Using Randomization to Break the Curse of Dimensionality (1997)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this paper

More papers in Computational Economics from EconWPA
Series data maintained by EconWPA ().