Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The OR Formalization Drive

A coordinated effort to formalize the mathematics of operations research in Lean 4.

Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.

1285 open missions

Missions

701–725 of 1285
Open1285Completed3527All4812
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times: Fluid Limit of the Maximum Queue Length with a Non-Zero Initial ConditionResearch Paper

A fork-join queue splits every incoming job into tasks, sends one task to each of NNN parallel servers, and declares the job complete only when all tasks are done. The model describes assembly systems in which a manufacturer orders parts from NNN suppliers and can only start production when every part has arrived, as well as parallel computing and storage…

17 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability+1·Captain: mikedeng1

Discrete Dividend Payments in Continuous Time: The Value Function Is the Unique Fixed Point of the One-Period Dividend-and-Issuance OperatorResearch Paper

A firm can return cash to shareholders by paying dividends, but a payment reduces the reserves available to survive future losses. If cash can be distributed only at scheduled dates while equity can be raised between those dates, the firm must coordinate a discrete dividend decision with a continuous-time financing decision. Keppo, Reppen and Soner study…

9 thms2 active usersReviewed
Algebraic GeometryConvex OptimizationOperations Research+1·Captain: mikedeng1

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization: The Set of Transition Points of the Optimal Partition Is FiniteResearch Paper

Sensitivity analysis asks how the solution of an optimization problem changes when its data move. For linear optimization the answer has been known since the 1990s: as the objective is perturbed along a fixed direction, the optimal partition (which variables can be positive at an optimum and which slacks can) stays constant on open intervals and changes…

11 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Optimal Use and Replenishment of Two Substitutable Raw Materials in a Stochastic Capacitated Make-to-Order Production System: A Use-Down-To/Balancing Production Policy Is OptimalResearch Paper

Make-to-order manufacturers may use two substitutable raw materials to satisfy demand when production capacity and material deliveries are uncertain. A cheaper material may yield less finished product per unit, and the firm must decide how much of each material to preserve for later periods. A production rule based only on current unit costs can be wrong…

11 thms2 active usersReviewed
Machine LearningOptimizationRandom Matrix Theory+1·Captain: mikedeng1

Nonconvex Low-Rank Tensor Completion from Noisy Data: Spectrally Initialized Vanilla Gradient Descent Recovers the Tensor Factors at a Linear Rate to Near-Optimal ℓ2 and ℓ2,∞ AccuracyResearch Paper

A partially observed array with three indices appears when data record relationships among triples of objects. If its entries have a low-rank structure, one can hope to recover the full array from far fewer than d3d^3d3 measurements. Cai, Li, Poor and Chen study this problem when the measurements are noisy and only a random subset of entries is seen. Their…

8 thms2 active usersReviewed
Algebraic TopologyAlgorithmic Game TheoryTopology·Captain: mikedeng1

Equipartition of a Segment: Every Continuous Function on Subsegments of [0, 1] Vanishing on Degenerate Segments Takes Equal Values on Some Partition of [0, 1] into m SegmentsResearch Paper

In fair division, a value may be assigned to each interval that a cut produces. If the value is continuous in the interval's endpoints, an equal-value partition is a natural target. Some valuations are nonnegative and additive, but a difference of competing measures or a signed utility need have neither property. Avvakumov and Karasev establish equal-value…

10 thms2 active usersReviewed
Graph TheoryOperations ResearchProbability·Captain: mikedeng1

A Dynamic Contagion Risk Model with Recovery Features: Fluid Limit for the Final Fraction of Failed Nodes in Threshold Contagion with Growth on the Configuration ModelResearch Paper

Financial networks, supply chains and contact networks share a failure mode: a node fails when enough of its counterparties have failed, and its failure in turn weakens its own counterparties. Threshold contagion on random graphs is the standard mathematical model of this. Amini, Cont and Minca (Resilience to contagion in financial networks, Mathematical…

10 thms2 active usersReviewed
Machine LearningMarkov ChainOperations Research+1·Captain: mikedeng1

Learning Markov Models Via Low-Rank Optimization: KL Error Bound for the Rank-Constrained Maximum Likelihood Estimator of a Low-Rank Markov ChainResearch Paper

Many systems studied in operations research and reinforcement learning are modelled as finite Markov chains with a large number of states ppp: the stops of a taxi in a city, a random walk on a network, the conformations of a molecule. Estimating the p×pp\times pp×p transition matrix from one observed trajectory needs, in general, a trajectory long compared with the …

13 thms2 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

Skill Acquisition and Data Sales: Under Uncertain Skill Acquisition and Accurate Data, Higher Skill-Acquisition Costs Raise Data Clarity, Data Price and Price InformativenessResearch Paper

Asset managers increasingly buy alternative data: satellite images, credit-card panels, web traffic. Raw data of this kind is worthless until someone has the skills to process it, and those skills are costly and uncertain to acquire. A fund can hire data scientists and still find that its models extract little. Huang, Xiong and Yang (Management Science, 2022…

11 thms2 active usersReviewed
Control TheoryOperations ResearchOptimization·Captain: mikedeng1

Managing Self-Replicating Innovative Goods: Characterization of the Optimal Production and Sales Policies under Strong ReplicabilityResearch Paper

Some goods can only be made by copies of themselves. RepRap and Prusa 3D printers print the parts of new printers, seed stock is grown from seed, and livestock herds breed. For such a good the inventory is also the production capacity: a unit sold today is a unit that will not replicate tomorrow. A firm launching such a good has to decide, at every instant,…

8 thms2 active usersReviewed
Algorithmic Game TheoryControl TheoryOperations Research+2·Captain: mikedeng1

Nonzero-Sum Stochastic Games and Mean-Field Games with Impulse Controls: A Regular Solution of the N-Player Quasi-Variational Inequalities Gives a Nash EquilibriumResearch Paper

An impulse control changes a system's state at a chosen instant, rather than continuously adjusting its drift. When several decision makers can intervene in the same state process, an intervention changes both the acting player's future cost and every opponent's. This makes the equilibrium question different from separate single-player control problems.…

11 thms2 active usersReviewed
EconomicsOperations ResearchProbability·Captain: mikedeng1

A General Analysis of Sequential Social Learning: Asymptotic Learning Holds for Every Utility Function if and only if Private Signals Are Totally UnboundedResearch Paper

In sequential social learning, agents act one after another. Each agent observes the actions of its predecessors and a private signal about an unknown state of the world. The model explains herd behaviour, information cascades and the adoption of products, technologies and opinions when people imitate one another. The basic question is whether the…

13 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchPartial Differential Equations+1·Captain: mikedeng1

Finite State Mean Field Games with Wright–Fisher Common Noise as Limits of N-Player Weighted Games: Normalized N-Player Equilibrium Values Converge to the Master Equation at a Polynomial RateResearch Paper

Mean field games describe Nash equilibria of games with very many symmetric players by a single limiting object. Whether, and how fast, the equilibria of the NNN-player game converge to that limit is the convergence problem. For games with common noise, a source of randomness shared by all players, the standard route goes through the master equation, a PDE on…

12 thms2 active usersReviewed
Control TheoryOperations ResearchProbability+1·Captain: mikedeng1

A Dynkin Game on Assets with Incomplete Information on the Return: The Entry Times of the Two Stopping Regions Form a Saddle Point When k > 0Research Paper

A game option (or Israeli option, introduced by Kifer, Game options, 2000) is an American option whose seller may also cancel the contract at any time, paying the exercise payoff plus a penalty. Pricing it is a Dynkin game: a zero-sum optimal stopping game in which the buyer chooses an exercise time to maximise the discounted payoff and the seller chooses a…

22 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime: Positive Spare Capacity Makes the Limiting Diffusion Uniformly Exponentially ErgodicResearch Paper

Call centres and hospital wards are run in the Halfin–Whitt regime: the number of servers nnn exceeds the offered load by a margin of order n\sqrt nn​, so that delays are short and servers are nearly always busy. With several customer classes, the operator must also choose a scheduling policy: which waiting class is served next. In the diffusion limit, every…

19 thms2 active usersReviewed
Algorithmic Game TheoryEconomicsMechanism Design+1·Captain: mikedeng1

Hospital Readmissions Reduction Program Does Not Provide the Right Incentives: Issues and Remedies: Under HRRP-I a Symmetric Equilibrium Exists and Every One Over-Invests in Readmission ReductionResearch Paper

The Hospital Readmissions Reduction Program (HRRP), created by the US Affordable Care Act and run by the Centers for Medicare & Medicaid Services since 2012, cuts the Medicare payments of hospitals whose 30-day readmission rates exceed a benchmark computed from other hospitals. It is a form of yardstick competition in the sense of Shleifer (1985): a…

14 thms2 active users
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Shipment Policies for Products with Fixed Shelf Lives: Impact on Profits and Waste: Shipping Oldest First Minimizes the Long-Run Average Warehouse Waste and the Total WasteResearch Paper

Manufacturers of products with fixed shelf lives must decide both how much to send from a warehouse to a store and which age cohorts to send. A shipment can reduce expiry at the warehouse while changing the age mix seen by shoppers at the store. In the two-echelon system studied by Akkaş and Honhon, the store does not control which items each shopper takes:…

7 thms2 active usersReviewed
Algorithmic Game TheoryControl TheoryOperations Research+1·Captain: mikedeng1

Game of Variable Contributions to the Common Good Under Uncertainty: The Symmetric Game Has a Regular Control Markov Perfect EquilibriumResearch Paper

Many shared assets deteriorate unless someone pays to maintain them: a public infrastructure stock, a jointly used ecosystem, a joint venture's capital, a common research base. When several parties benefit from the same stock and each pays for its own contributions, every party is tempted to wait for the others to pay. Kwon (arXiv:1904.00500, published in Op…

10 thms2 active usersReviewed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

Minimax-Optimal Policy Learning Under Unobserved Confounding: Minimizing the Worst-Case Empirical Regret Attains the Population Minimax Regret up to an Explicit n^(-1/2) TermResearch Paper

Personalized decisions in medicine, marketing and public policy are increasingly learned from observational data: records of who received which treatment and how it turned out. Standard policy-learning methods assume unconfoundedness, that treatment assignment depends only on observed covariates. When an unobserved factor influences both the treatment and…

10 thms2 active usersReviewed
Algorithmic Game TheoryEconomicsMechanism Design+1·Captain: mikedeng1

Persuading Customers to Buy Early: The Value of Personalized Information Provisioning: The Personalized Buy/Wait/No Mechanism Is Optimal and Strictly Beats Public SignalingResearch Paper

A seller who sells over two periods, at a full price now and a discount later, loses revenue to strategic customers who wait for the discount. Waiting is costly to the customer only through availability risk: if inventory is scarce, the product may be gone by the second period. Inventory is usually known to the firm and not to its customers, so the firm can…

12 thms2 active usersReviewed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

Addictive Platforms 1: Monopoly versus Duopoly — Competition Raises Addictiveness and Hurts the Consumer When Attention Is Scarce, and Lowers Addictiveness When It Is AbundantResearch Paper

Digital services are paid for with attention: an ad-financed platform earns more the longer its users stay. Policy reports on digital markets (Crémer, de Montjoye and Schweitzer, 2019; the U.K. Digital Competition Expert Panel, 2019; Scott Morton et al., 2019) worry that such firms degrade their services with features that capture attention at the user's…

9 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers 1: Robust-LP Inlier Error ≤ Cn²·max{exp(−Δ²min/64σ²max), log nmin/nmin} with Probability ≥ 1 − 2r/nminResearch Paper

Clustering points drawn from a mixture of well-separated distributions is a basic problem of unsupervised learning. Practical data sets also contain outliers, points that belong to no cluster and may be placed anywhere. Srivastava, Sarkar and Hanasusanto (arXiv:1912.07546v3; Operations Research 71(1), 2023) propose a robust spectral clustering algorithm. It…

16 thms2 active usersReviewed
Operations ResearchProbabilityRandom Matrix Theory+1·Captain: mikedeng1

The Risk of Expected Utility Under Parameter Uncertainty I: Closed-Form Out-of-Sample Utility Variance of the Shrinkage Mean-Variance PortfolioResearch Paper

A portfolio chosen from historical returns can look attractive in the data used to construct it and deliver a different result when evaluated under the population return distribution. The gap is driven by estimation error in both the mean return and covariance matrix. A mean of future utility values describes average performance, but it does not describe…

22 thms2 active usersReviewed
Algorithmic Game TheoryConvex OptimizationEconomics·Captain: mikedeng1

Infinite-Dimensional Fisher Markets and Tractable Fair Division 3: The Quasilinear Eisenberg–Gale Programs Attain Their Optima and Characterize Quasilinear EquilibriaResearch Paper

A Fisher market allocates a common supply of items among buyers with separate budgets. When the items form a continuum, such as positions in a measurable interval, a buyer's valuation and the market price are functions rather than finite lists. This is a useful model for divisible resources and for settings in which an allocation can be described as a…

10 thms2 active usersReviewed
Convex OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing 1: Arc Balancing Control Has Loss O(log(1+n)^{3/2}/n^{2/3})Research Paper

A ride-hailing firm chooses prices while drivers move through a city. A trip from one region uses a driver immediately and returns that driver at another region only after a travel delay. Prices affect which trips are requested, but the actual requests fluctuate. A plan that ignores these fluctuations can run out of available drivers at a busy origin even…

7 thms2 active usersReviewed
PreviousPage 29 of 52Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36475424
5NINickrobbins953286155
6VEvebis25800
7FIfizzyinc321725
8SHshivm17490
9SCShuze Chen9455324
10KMkmehltretter82895261

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