econ.GNApr 15, 2026

A Comparative Study of Dynamic Programming and Reinforcement Learning in Finite Horizon Dynamic Pricing

Authors: Lev Razumovskiy, Nikolay Karenin

Abstract

This paper provides a systematic comparison between Fitted Dynamic Programming (DP), where demand is estimated from data, and Reinforcement Learning (RL) methods in finite-horizon dynamic pricing problems. We analyze their performance across environments of increasing structural complexity, ranging from a single typology benchmark to multi-typology settings with heterogeneous demand and inter-temporal revenue constraints. Unlike simplified comparisons that restrict DP to low-dimensional settings, we apply dynamic programming in richer, multi-dimensional environments with multiple product types and constraints. We evaluate revenue performance, stability, constraint satisfaction behavior, and computational scaling, highlighting the trade-offs between explicit expectation-based optimization and trajectory-based learning.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Relating Reinforcement Learning to Dynamic Programming-Based Planning

    Mar 8, 2026Filip V. Georgiev, Kalle G. Timperi, Başak Sakçak +1Markov Decision ProcessesDynamic Programming

  2. On Non-Stationary Dynamic Pricing: Adaptivity and Optimality

    Jul 27, 2026Feiyu Jiang, Zifeng ZhaoNon-Stationary BanditsDynamic Pricing