F.A.R.O.G. FORUM, Vol. 4 No. 4

https://digitalcommons.library.umaine.edu/francoamericain_forum/1015/thumbnail.jp

F.A.R.O.G. FORUM, Vol. 4 No. 2

https://digitalcommons.library.umaine.edu/francoamericain_forum/1055/thumbnail.jp

F.A.R.O.G. FORUM, Vol. 4 No. 3

https://digitalcommons.library.umaine.edu/francoamericain_forum/1014/thumbnail.jp

The complexity of dynamic programming

AbstractWe provide tight lower bounds on the computational complexity of discretetime, stationary, infinite horizon, discounted stochastic control problems, for the case where the state space is continuous and the problem is to be solved approximately, within a specified accuracy. We study the dependence of the complexity on the desired accuracy and on the discount factor

F.A.R.O.G. FORUM, Vol. 6 No. 8

https://digitalcommons.library.umaine.edu/francoamericain_forum/1069/thumbnail.jp

F.A.R.O.G. FORUM, Vol. 6 No. 5

https://digitalcommons.library.umaine.edu/francoamericain_forum/1066/thumbnail.jp

Sommaire

Content and Front matterPage de garde et Sommair

F.A.R.O.G. FORUM, Vol. 8 No. 1

https://digitalcommons.library.umaine.edu/francoamericain_forum/1074/thumbnail.jp

F.A.R.O.G. FORUM, Vol. 7 No. 5

https://digitalcommons.library.umaine.edu/francoamericain_forum/1070/thumbnail.jp

F.A.R.O.G. FORUM, Vol. 7 No. 8

https://digitalcommons.library.umaine.edu/francoamericain_forum/1073/thumbnail.jp