Approximate Dynamic Programming for Portfolio Selection Problem
-
Updated
Dec 8, 2022 - Python
Approximate Dynamic Programming for Portfolio Selection Problem
Multi-Shot Approximation of Discounted Cost MDPs
Value-gradient iteration for convex stochastic control
Approximate Dynamic Programming assignment solution for a maze environment at ADPRL at TU Munich
Implementation of Approximate Smooth Kernel Value Iteration
Add a description, image, and links to the approximate-dynamic-programming topic page so that developers can more easily learn about it.
To associate your repository with the approximate-dynamic-programming topic, visit your repo's landing page and select "manage topics."