Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Dynamic Programming

347 missions · 247 completed

Missions

Open100Completed247All347
Operations ResearchProbabilityStochastic Systems·Captain: iris

Constant Regret Resolving Heuristics for Price-Based Revenue Management: Under Limited Inventory the Resolving Heuristic Earns Within a Horizon-Independent Constant of the Optimal Pricing PolicyResearch Paper

Price-based revenue management studies a seller with a fixed stock of a product and a finite selling season who adjusts prices over time to maximize expected revenue. The exact optimal policy solves a dynamic program whose state is the remaining inventory and time; it is rarely computed in practice, and the network version with many products and resources…

16 thms3 active usersReviewed
Control TheoryOperations Research·Captain: iris

Sales Effort Management Under All-or-Nothing Constraint: The Optimal Sales Rate Has a Watershed Structure in the Time-to-Go, With a Cutoff Strictly Increasing in the Sales Still NeededResearch Paper

Sales targets with a bonus are a standard incentive in practice: a car dealership earns a manufacturer bonus only if it sells a quota of vehicles in a quarter, and a salesperson earns a lump sum only when a quota is met. Contracts of this all-or-nothing type pay nothing below the target and a bonus plus a per-unit commission above it. They raise a dynamic…

13 thms3 active usersReviewed
Operations ResearchOptimizationProbability·Captain: iris

Multi-product Dynamic Pricing with Limited Inventories under a Cascade Click Model: The Cascade Correction Policy Loses O(log⁡k)O(\log k)O(logk) Against the Deterministic BenchmarkResearch Paper

Online retailers show products in a fixed order, and a customer reads the list from the top. Models of this behavior, the cascade click model, come from sponsored search (Craswell et al., 2008; Aggarwal et al., 2008) and now drive assortment and ranking decisions. Najafi, Duenyas, Jasin and Uichanco combine it with the classical problem of pricing a limited…

20 thms3 active usersReviewed
Bandit AlgorithmsMarkov ChainOperations Research·Captain: iris

Unichain and Aperiodicity Are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits: The Set-Expansion Policy Has Optimality Gap at Most 256 r_max λ_W²|S|²/(β²√N)Research Paper

A restless bandit couples NNN identical Markov decision processes through a budget: at every time step exactly αN\alpha NαN of the NNN arms must be pulled, and every arm changes state whether it is pulled or not. The model, introduced by Whittle (1988), describes scheduling of machines or patients, sensor management, queueing control and recommendation. Computing…

23 thms3 active usersReviewed
Machine LearningOperations ResearchReinforcement Learning·Captain: iris

Adaptive Discretization in Online Reinforcement Learning: AdaMB and AdaQL Have Regret Scaling with the Zooming DimensionResearch Paper

Reinforcement learning in operations problems (inventory control, ambulance routing, pricing, queue admission) often has continuous state and action spaces. A fixed grid of mesh ϵ\epsilonϵ wastes samples on regions where nothing is learned, and its regret grows with the ambient dimension of S×A\mathcal S\times\mathcal AS×A. Adaptive discretization refines a…

37 thms3 active usersReviewed
Operations ResearchOptimizationRevenue Management and Pricing·Captain: iris

Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model: A Dynamic Program Earns 1 − ε of Optimal in Time Polynomial in Input Size, 1/ε and γ⁺/γ⁻Research Paper

The Nested Logit model is one of the most widely used discrete choice models in revenue management. It captures substitution that the Multinomial Logit model cannot: products are grouped into nests, a customer first chooses a nest and then a product in it (Davis, Gallego, Topaloglu, 2014; Gallego, Topaloglu, 2014). A retailer that decides which products to…

24 thms3 active usersReviewed
Operations Research·Captain: iris

Dynamic Pricing with Point Redemption: the optimal price lies strictly between the one-period blackout price and the reimbursement rateResearch Paper

Hotels, airlines and retailers increasingly let customers pay with loyalty points from a third-party program: a consumer either pays the cash price ppp or redeems a fixed number qqq of points, and for every reward sale the seller receives a reimbursement RRR from the point issuer. A seller with limited inventory and a finite selling season must then set its cash…

7 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Dynamic Pricing of Relocating Resources in Large Networks: the Lagrangian policy is within O(√(ln n/n)) of optimal in hub-and-spoke networksResearch Paper

Ride-hailing, car-sharing and bike-sharing platforms price trips whose execution moves the resource itself: a car that takes a passenger from the suburbs to the airport is no longer available in the suburbs. Each price therefore sets both the revenue of the current request and the future spatial distribution of the fleet. Choosing prices to maximise…

23 thms3 active usersReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models: The Sampled Upper Base-Stock Policy Costs at Most (1 + ε) Times the Optimum with Probability 1 − δResearch Paper

The periodic-review inventory problem asks how much stock to order in each of TTT periods when demand is random, unmet demand is backlogged, and both leftover stock and shortages are charged. When the demand distributions are known, a backward dynamic program computes an optimal policy, and the optimal policy is a base-stock policy: in each period, order up…

15 thms3 active usersReviewed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Analytical Solution to a Partially Observable Machine Maintenance Problem with Obvious Failures: The Optimal Maintenance Frontier Has Six Possible StructuresResearch Paper

Machines in production lines deteriorate in ways that are only partly visible. A machine may run in a degraded state that raises costs without announcing itself, and eventually fail in a way that cannot be missed. The decision maker must choose between continuing production, paying for an inspection that reveals the hidden state, and replacing the machine…

19 thms3 active usersReviewed
Control TheoryMarkov ChainStochastic Systems·Captain: mikedeng1

Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time 4: Limits of Equilibria of the Time-Discretized Problems Are Weak Equilibria in Continuous TimeResearch Paper

A decision maker is time-inconsistent when the plan that is optimal today stops being optimal tomorrow. The standard source is non-exponential discounting: a reward ttt units of time ahead is weighted by δ(t)\delta(t)δ(t), and unless δ\deltaδ is exponential the relative weight of two future dates changes as time passes. Hyperbolic and pseudo-exponential discount…

8 thms3 active usersReviewed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

More Risk-Sensitive Markov Decision Processes 5: Under Positive Harris Recurrence a Risk-Neutral Optimal Stationary Policy Is Optimal for Power-Utility Average CostResearch Paper

Classical Markov decision theory minimizes expected cost. A decision maker who dislikes variability, such as an insurer, a portfolio manager or an operator of a service system, may instead evaluate a random cost YYY by its certainty equivalent U−1(E[U(Y)])U^{-1}(\mathbb E[U(Y)])U−1(E[U(Y)]) for an increasing utility (disutility) function UUU. Bäuerle and Rieder (More Risk-Sensitive…

9 thms3 active usersReviewed
Markov ChainOperations ResearchOptimization·Captain: mikedeng1

Optimality of (s, S) Policies in Inventory Models with Markovian Demand II: In the Nonstationary Discounted Infinite-Horizon Problem, a State-Dependent (s, S) Policy Is OptimalResearch Paper

Periodic-review inventory models with a fixed ordering cost are the setting in which the (s,S)(s,S)(s,S) policy is optimal: when the stock falls below a reorder point sss, order up to a level SSS, otherwise order nothing. Scarf (1960) proved this for independent demands over a finite horizon by introducing KKK-convexity, and Iglehart (1963) extended it to the discounted…

11 thms3 active usersReviewed
Markov ChainOperations Research·Captain: mikedeng1

Average Optimality in Dynamic Programming with General State Space: Under (W) or (S) and Bounded Relative Discounted Values, a Limit of Discount-Optimal Policies Is Average OptimalResearch Paper

A Markov decision process with the average cost criterion asks for a policy that minimizes the long-run expected cost per unit time. The criterion is the natural one for inventory, queueing and maintenance systems that run indefinitely without a meaningful discount rate, and it is the standard benchmark in the theory of controlled Markov chains (Arapostathis…

15 thms3 active usersReviewed
Control TheoryOperations ResearchOptimization+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case IX: Imperfect State Information — Reduction to a Perfect-Information Model through a Statistic Sufficient for ControlTextbook

In most control problems the controller does not see the state of the system. It sees noisy observations, remembers its past controls, and must act on that record. Inventory systems with delayed or inaccurate counts, maintenance of machines whose wear is only inspected, target tracking, and medical treatment planned from test results all have this form. The…

15 thms3 active usersReviewed
Control TheoryOperations ResearchProbability+1·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case VII: The Finite-Horizon Borel Model — over Universally Measurable Policies J*_K = T^K(J_0)Textbook

Finite-horizon stochastic control on general state and control spaces — inventory levels, queue lengths, positions, beliefs — cannot be written down without measure theory, and the measure theory turns out to be the hard part. The dynamic programming (DP) recursion "start from zero and minimise one stage at a time" is easy to state, but on uncountable…

19 thms3 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Dynamic Pricing Strategies with Reference Effects II: A Myopic Firm Underprices and Its Prices Converge MonotonicallyResearch Paper

Consumers judge a price against a reference price, an internal expectation formed from the prices they have seen before. A price below the reference feels like a gain and raises demand, a price above it feels like a loss and lowers demand. Because today's price moves tomorrow's reference price, a firm facing such consumers solves a dynamic problem even when…

12 thms3 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: Shuze Chen

Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with kkk-SUM in 2DResearch Paper

In ddd-Knapsack (the vector or multidimensional knapsack problem) every item has a profit and a ddd-dimensional weight vector, and one must choose a set of items of maximum total profit whose total weight stays within a capacity in every coordinate. It models any selection problem with several budgets at once (money, time, space, staff) and is the simplest…

21 thms2 active usersReviewed
Complexity TheoryOperations ResearchOptimization·Captain: iris

Multi-Selection Pandora's Box with Nonobligatory Inspection: A PTAS and a Structural SeparationResearch Paper

Pandora's box is a basic model of costly search. Weitzman (1979) showed that a simple index policy is optimal when a box must be opened before its prize can be selected. In many settings a searcher may select an option without inspecting it: a firm may hire a candidate on their record alone. This gives Pandora's box with nonobligatory inspection (PNOI). The…

107 thms2 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: iris

Markov Decision Processes with Applications to Finance XIII: Piecewise Deterministic Markov Decision Processes Have Optimal Nonrelaxed Markov PoliciesTextbook

Many controlled systems move deterministically between random shocks: an insurer's reserve between claims, a portfolio between market jumps, a production line between breakdowns. Piecewise Deterministic Markov Processes, introduced by Davis (Piecewise-deterministic Markov processes, JRSS B, 1984), are the general class of such non-diffusions. Their control…

21 thms2 active usersReviewed
Operations ResearchProbabilityTheoretical Computer Science·Captain: iris

Online Policies for Efficient Volunteer Crowdsourcing: The Sparse Notification Policy Is 12−q(1−1e)\frac{1}{2-q}(1-\frac{1}{e})2−q1​(1−e1​)-CompetitiveResearch Paper

Nonprofit crowdsourcing platforms rely on volunteers to perform time-sensitive tasks. On Food Rescue U.S., for example, a task is a scheduled pickup of a perishable donation, and when a task goes unclaimed the platform can push a notification to a subset of volunteers. Notifying more volunteers raises the chance that the current task gets done, but…

19 thms2 active usersReviewed
Linear OptimizationOperations Research·Captain: iris

Self-Adapting Network Relaxations for Weakly Coupled Markov Decision Processes: Every Feasibility Network Relaxation Bound Lies Between the Optimal Value and the Lagrangian BoundResearch Paper

Many sequential decision problems in operations research consist of a number of independent subsystems that interact only through shared resources: assortment and inventory decisions under a common budget, multi-armed bandits with a cap on the number of arms pulled, scheduling with capacity limits. Such problems are modelled as weakly coupled Markov…

14 thms2 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: iris

Technical Note—Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations: The Fluid-LP Policy Is 1/(4L)-Approximate and Asymptotically OptimalResearch Paper

Revenue management systems forecast demand over canonical intervals of time, such as a week, often with a general distribution for each week, and the demand of one week is a signal for the next. The prevalent demand model, a discrete-time approximation to a Poisson process, cannot reproduce this. With one arrival per period, arrival probabilities λt\lambda_tλt​ a…

22 thms2 active usersReviewed
EconomicsOperations Research·Captain: iris

Pricing for the Stars: Dynamic Pricing in the Presence of Rating Systems: rating sensitivity raises long-run profits and ratings, and raises prices and lowers consumer surplus exactly when κ < 1/2Research Paper

Online marketplaces such as Amazon and Steam show each product's aggregate rating, a summary of past reviews, next to its current price. Reviews are left by buyers, and who buys depends on the price, so a seller who changes the price today changes the reviews that tomorrow's rating is made of. Platforms also choose how the rating is computed; in recent…

8 thms2 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: iris

Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations: The Optimal Online Policy's Expected Regret Grows at Least Logarithmically in the HorizonResearch Paper

In an online linear program, customers arrive one at a time and a firm must accept or reject each one at once, spending a shared inventory of mmm resources. The model covers network revenue management, ad allocation and order fulfilment (Li and Ye, 2022). Its central performance measure is the regret: the gap between what an omniscient planner collects and…

25 thms2 active usersReviewed
PreviousPage 2 of 4Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me