Papers › Convex function approximations for Markov decision processes
Convex function approximations for Markov decision processes
Jeremy Yee
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes for the driving random variables. Under some conditions, these approximations form a monotone sequence of lower or upper bounding functions. Numerical experiments involving piecewise linear functions demonstrate that very tight bounding functions for the fair price of a Bermudan put option can be obtained with excellent speed (fractions of a cpu second). Results in this paper can be easily adapted to minimization problems involving concave Bellman functions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections