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

351–375 of 1285
Open1285Completed3527All4812
EconomicsOperations ResearchProbability·Captain: mikedeng1

Operational Risk Management: Optimal Inspection Policy I: Periodic Inspection Beats Random Inspection Below an Inspection-Cost Threshold and Loses Above ItResearch Paper

A firm that relies on employees to process transactions can lose money when errors remain undetected. Inspection catches errors, but each inspection costs money, and employees may change their care when they know when an inspection will occur. These effects make the timing of inspections part of a contract design problem, not just a scheduling choice. Kim…

8 thms3 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·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
ProbabilityRandom Matrix TheoryStatistics·Captain: mikedeng1

Change-Point Detection in Dynamic Networks with Missing Links III: The Dyadic-Grid Matrix CUSUM Test Detects an Unknown Change Time Above Energy 4(1+ϵ)(6ω_n/T)^{1/2} + C log(4n log₂T/(α∧β))/√TResearch Paper

Many networks are recorded as a sequence of snapshots: contact networks in epidemiology, communication graphs, brain connectivity measured over time, trade or transport links. A basic statistical question is whether the law generating the snapshots changed at some point. Two features make the question hard in practice. The networks are often sparse, so each…

12 thms3 active usersReviewed
Experimental DesignOperations ResearchProbability+1·Captain: mikedeng1

Pigeonhole Design: Balancing Sequential Experiments from an Online Matching Perspective 3: For p ≥ 2 Continuous Covariates, Expected Discrepancy O(T^(1−φ) + T^((p−1)φ)), with (log T)^(3/2) at p = 2Research Paper

Online platforms run randomized experiments on subjects (users, sessions, orders) that arrive one at a time and must be assigned to a control or a treatment group on arrival, before later subjects are seen. The precision of a treatment-effect estimate depends on how similar the two groups are in their observed covariates. When the groups are badly balanced,…

12 thms3 active usersReviewed
Control TheoryEconomicsOperations Research+1·Captain: mikedeng1

Equilibrium Portfolio Selection for Smooth Ambiguity Preferences: The Closed-Form Equilibrium Strategy under a Gaussian PriorResearch Paper

An investor who does not know the expected return of a stock faces two kinds of uncertainty: risk (the randomness of returns given the model) and ambiguity (uncertainty about which model is true). The smooth ambiguity criterion of Klibanoff, Marinacci and Mukerji (Econometrica 2005) separates the two: the investor first computes the expected utility …

24 thms3 active usersReviewed
Algorithmic Game TheoryEconomicsOperations Research+1·Captain: mikedeng1

Retailer-Led Marketplaces 1: Below a Capacity Threshold the Monopolist Competes Only in the Top Marketplace Products (Mode I); Above It He Also Monopolizes Unsupplied Products (Mode II)Research Paper

Large online retailers such as Amazon run two businesses on one storefront. They sell products themselves, and they host a marketplace on which third-party sellers sell, paying the platform a percentage of their revenue. A retailer that also runs the marketplace can decide which products to sell itself, and it controls which offer most consumers see.…

16 thms3 active users
Machine LearningOptimizationReinforcement Learning·Captain: mikedeng1

Structural Estimation of Markov Decision Processes in High-Dimensional State Space with Finite-Time Guarantees: Single-Loop ML-IRL Policy and Reward Iterates Converge at Explicit Finite-Time RatesResearch Paper

Structural estimation of Markov decision processes recovers the parameters of an agent's reward from observed behavior, under the hypothesis that the agent acts optimally in a known dynamic environment. In econometrics this is the dynamic discrete choice model of Rust (Rust 1987); in artificial intelligence it is maximum-likelihood inverse reinforcement…

18 thms3 active usersReviewed
Algorithmic Game TheoryGraph TheoryOperations Research·Captain: mikedeng1

Flow Allocation Games 1: Every Unit-Ranking Game Has a Strong Equilibrium That Maximizes the Total FlowResearch Paper

Financial firms owe each other money. When some firms cannot meet their obligations, the payments that actually clear in the network are a fixed point: what a firm can pay depends on what it receives, which depends on what others can pay. Eisenberg and Noe (Management Science, 2001) introduced this clearing model under a fixed pro-rata payment rule. Later…

18 thms3 active users
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Simple and Explicit Bounds for Multiserver Queues with 1/(1−ρ) Scaling: With More Than 2.5 Finite Service Moments, GI/GI/n Steady-State Queue Tails and Delay Probability Obey Explicit BoundsResearch Paper

Multi-server queues model call centres, hospital wards, cloud server pools and any system in which nnn identical servers work through one first-come-first-served (FCFS) line. Capacity planning for such systems needs bounds on the steady-state queue length and on the probability of delay (the chance that an arriving job finds every server busy) that are…

17 thms3 active usersReviewed
Operations ResearchOptimizationPartial Differential Equations+1·Captain: mikedeng1

Optimality Conditions in Control Problems with Random State Constraints in Probabilistic or Almost Sure Form II: Explicit Optimality Conditions for Probabilistic Elliptic PDE State ConstraintsResearch Paper

Optimal control of partial differential equations under uncertainty arises whenever a physical system is steered by a control while its sources, coefficients or loads are only known in distribution. A typical requirement is a state constraint: the state (a temperature, a concentration, a displacement) must stay below a threshold everywhere in the domain.…

23 thms3 active usersReviewed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Achieving Efficiency in Black-Box Simulation of Distribution Tails with Self-Structuring Importance Samplers: The Self-Structuring Importance Sampler Is Logarithmically EfficientResearch Paper

Many operational risk questions ask for a small probability pu=P(L(X)≥u)p_u=P(L(X)\ge u)pu​=P(L(X)≥u): the chance that the cost LLL of a decision, evaluated at a random scenario X∈RdX\in\mathbb R^dX∈Rd, exceeds a large threshold uuu. Examples are large delays in project networks or vehicle routing, large portfolio credit losses, and failures in engineered systems. Plain Monte Carlo needs on…

17 thms3 active usersReviewed
Operations ResearchProbability·Captain: LG

Symmetric Rendezvous on the LineOpen Problem

Rendezvous search asks how two agents who cannot communicate should move so as to meet as quickly as possible. It was introduced as a mathematical problem by Alpern (The rendezvous search problem, SIAM J. Control Optim. 1995) and developed systematically in Alpern and Gal's monograph The Theory of Search Games and Rendezvous (Kluwer, 2003). Besides its…

9 thms3 active usersReviewed
Control TheoryDynamic ProgrammingMarkov Chain+1·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
AlgebraCombinatoricsDiscrete Geometry·Captain: mikedeng1

A Large Family of Maximum Scattered Linear Sets of PG(1, q^n) and Their Associated MRD Codes 1: For q Odd, t ≥ 3, h ∉ 𝔽_{q^t} and h^(q^t+1) = −1, ψ_{h,t} Is Scattered over 𝔽_{q^{2t}}Research Paper

A linear set of a projective space over a finite field is the set of points spanned by the nonzero vectors of a subspace over a subfield. They have been used to construct and characterize semifields, rank-metric codes, translation spreads, translation ovoids, two-intersection sets and the blocking sets for which Lunardon introduced them (Polverino 2010;…

13 thms3 active usersReviewed
Machine LearningOperations ResearchOptimal Transport+1·Captain: mikedeng1

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality 3: Under T₂(τ), W₂-Robust Loss at Radius ρ̃ₙ Bounds True Loss up to 4r⋆+2εₙ+ħρ̃ₙ²Research Paper

Wasserstein distributionally robust optimization (Wasserstein DRO) replaces the empirical loss EPn[f]\mathbb E_{\mathbb P_n}[f]EPn​​[f] of a decision by its worst case over all distributions within Wasserstein distance ρ\rhoρ of the empirical distribution Pn\mathbb P_nPn​. It is used in operations research (newsvendor, portfolio selection) and machine learning (adversarially…

15 thms3 active usersReviewed
Machine LearningOperations ResearchOptimal Transport+1·Captain: mikedeng1

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality 2: Under T₁(τ), W₁-Robust Loss at Radius 2√(τt/n)+√(4r⋆+2/n) Bounds the True LossResearch Paper

Wasserstein distributionally robust optimization (DRO) replaces the empirical loss EPn[f]\mathbb E_{\mathbb P_n}[f]EPn​​[f] of a decision or model fff by its worst case over all distributions within a Wasserstein distance ρ\rhoρ of the empirical distribution Pn\mathbb P_nPn​. It is used in operations research (newsvendor, portfolio and inventory problems) and in machine learning…

13 thms3 active usersReviewed
Convex OptimizationOptimization·Captain: mikedeng1

EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization 1: For 0 < α < 2λmin(W̃)/L_f, EXTRA Converges and Its Optimality Residuals Are O(1/k) on Average, o(1/k) at BestResearch Paper

In decentralized consensus optimization a connected network of nnn agents cooperatively solves

15 thms3 active usersReviewed
Complexity TheoryConvex OptimizationMachine Learning+1·Captain: mikedeng1

Tight Complexity Bounds for Optimizing Composite Objectives III: Any Deterministic Algorithm with Gradient and Prox Oracles Needs Ω(m√(γ/λ)·log(λε₀/(γε))) Queries on Smooth Strongly Convex SumsResearch Paper

Many problems in machine learning and statistics minimize an average of component losses, F(x)=1m∑i=1mfi(x)F(x)=\frac1m\sum_{i=1}^m f_i(x)F(x)=m1​∑i=1m​fi​(x): one term per training example, per data shard, or per block of a decomposed objective. Incremental methods such as SAG, SVRG, SAGA, SDCA and their accelerated variants touch one component at a time, so the natural measure of their work…

10 thms3 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Linear-Quadratic Optimal Control Problems for Mean-Field Stochastic Differential Equations: Two Riccati Equations Give the Optimal State-Feedback Control and the Value ⟨Π(0)x, x⟩Research Paper

Linear-quadratic (LQ) control is the setting in which stochastic optimal control has a closed-form answer: the optimal control is a linear feedback of the state, and the feedback gain comes from a Riccati differential equation. In the mean-field version, the expectation E[X]\mathbb E[X]E[X] of the state and E[u]\mathbb E[u]E[u] of the control appear in the dynamics and in…

15 thms3 active usersReviewed
Complexity TheoryConvex OptimizationMachine Learning+1·Captain: mikedeng1

Tight Complexity Bounds for Optimizing Composite Objectives I: Any Deterministic Algorithm with Gradient and Prox Oracle Access Needs Ω(mLB/ε) Queries on Sums of m Convex L-Lipschitz FunctionsResearch Paper

Many optimization problems minimize the average of component losses: one loss per observation, machine, or term in an objective. When an algorithm can inspect one component at a time, the number of component queries is a useful measure of work. A component oracle can provide more than a value or subgradient: a proximal point summarizes a global minimization…

8 thms3 active usersReviewed
Functional AnalysisHarmonic Analysis·Captain: mikedeng1

Isotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations I: u ∈ V^η(−1,1) iff Σ u_ℓ²(2ℓ+1)(1+ℓ^{2η}) < ∞Research Paper

A centered isotropic Gaussian random field TTT on the unit sphere S2\mathbb S^2S2 is determined by its angular power spectrum (Aℓ)ℓ≥0(A_\ell)_{\ell \ge 0}(Aℓ​)ℓ≥0​: its covariance is

11 thms3 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Learning without Concentration: Least-Squares ERM in a Convex Class Is Within 2 max{α_N(γ, δ/4), βN(τQ{F−F}(2τ)/16)} of f* in L₂ under a Small-Ball ConditionResearch Paper

Least-squares regression over a class of functions is the basic problem of statistical learning theory: given an i.i.d. sample (Xi,Yi)i=1N(X_i,Y_i)_{i=1}^N(Xi​,Yi​)i=1N​ from an unknown joint law, select a function in a class FFF whose prediction error E(f(X)−Y)2\mathbb E(f(X)-Y)^2E(f(X)−Y)2 is close to the best possible in FFF. The standard analysis of empirical risk minimization (ERM) compares empirical…

11 thms3 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

A Solution to the 1-2-3 Conjecture: Every Finite Graph Without a K2 Component Has an Edge-Weighting from {1,2,3} Whose Weighted Degrees Properly Color the VerticesResearch Paper

Many graph-colouring questions ask whether a proper colouring can be produced indirectly, from local data, instead of being assigned vertex by vertex. In the 1-2-3 Conjecture, the colours are produced by weighting the edges of a graph and colouring each vertex with the sum of the weights at it. Karoński, Łuczak and Thomason asked in 2004 whether weights…

14 thms3 active usersReviewed
Markov ChainProbabilityStatistics·Captain: mikedeng1

Spectral Gaps for a Metropolis–Hastings Algorithm in Infinite Dimensions III: The L²-Spectral Gap of Random Walk Metropolis for a Gaussian Target Vanishes Faster Than Any Power of the DimensionResearch Paper

Bayesian inverse problems and conditioned diffusions lead to probability measures on function spaces, and these are sampled in practice through finite-dimensional approximations on Rm\mathbb R^mRm with mmm large. A Markov chain Monte Carlo method is useful in this setting only if its convergence rate does not deteriorate as the discretisation is refined. Random…

12 thms3 active usersReviewed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

Approximate Revenue Maximization with Multiple Items 6: With n Buyers and Dominant-Strategy Implementation, Selling Two Independent Goods Separately Earns at Least Half the Optimal RevenueResearch Paper

A seller who owns several goods and faces buyers with private values must decide how to sell them. The revenue-maximizing mechanism is known in closed form only for one good: for a single buyer it is a posted price, and for several buyers it is Myerson's optimal auction (Myerson 1981). With two or more goods the optimal mechanism may use lotteries, may be…

8 thms3 active usersReviewed
PreviousPage 15 of 52Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36415412
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