When to Commit and When to Defer: Maturing Markov Decision Processes under Refining Information and Expiring Opportunities
Not on the map. Why?
Abstract (arXiv)
Sequential decisions often become better informed as action opportunities expire. We introduce Maturing Markov Decision Processes (MMDPs), a structured subclass of augmented finite-horizon Markov decision processes, for organizing when to commit and when to defer. The Expiring-Actions-First Principle provides a sufficient condition for deferral based on information gain and delay loss. This structure motivates stage-local policies, action abstraction, and policy-guided planning. Replenishment experiments show improved learning and test performance under the MMDP interface and, in the primary setting, a larger test-performance gain from forecast refinement. In synthetic cash management, MMDP improves PPO test returns across both network sizes; five-account equal-size mask controls show that action count alone does not explain its learned gain, and the advantage persists with action abstraction and policy-guided search. A production-scale cash-management case study adds complementary evidence. Together, these results support commitment timing as a useful inductive bias for learning and planning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 39 references that are in the map. First posted on arXiv 17 Jun 2026.
Builds on
14 of 39 references.
References · 14
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
- 2017Thinking Fast and Slow with Deep Learning and Tree Searchcited by 252
- 2021Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPscited by 122
- 2015Parallelizing the dual revised simplex methodcited by 89
- 2015Deep Reinforcement Learning in Parameterized Action Spacecited by 68
- 2015Reinforcement Learning with Parameterized Actionscited by 63
- 2020Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routingcited by 61
- 2026DeepStock: Reinforcement Learning with Policy Regularizations for Inventory Managementcited by 5
- 2018Maximum Weight Online Matching with Deadlinescited by 3
Built on by
Not cited yet.