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

1101–1125 of 1285
Open1285Completed3527All4812
Control TheoryDynamic ProgrammingProbability+1·Captain: mikedeng1

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations: The N-Player Common-Noise Control Value Converges to the McKean–Vlasov ValueResearch Paper

A controller of a large population may choose a separate action for each participant while all participants experience the same random environment. The resulting optimization problem has a growing state space: with NNN participants, the state records NNN paths and NNN controls. A McKean–Vlasov control problem replaces the empirical distribution of those…

10 thms1 active userReviewed
Machine LearningProbabilityReinforcement Learning+1·Captain: mikedeng1

Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning: Cross-Fitted DRL Is Asymptotically Linear and Normal at the MDP Efficiency BoundResearch Paper

Off-policy evaluation (OPE) asks for the long-run value of a target decision policy, using only data collected under a different policy. It arises wherever running the target policy is expensive or unsafe: a new treatment rule in medicine, a new recommendation or pricing rule, a candidate controller in reinforcement learning. Importance-sampling estimators…

13 thms1 active userReviewed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Optimal Portfolio Choice with Estimation Risk: No Risk-Free Asset Case: For h > N + 3 the Combining Coefficient c̃* = kψ²/(ψ² + (N−1)/h) Uniquely Maximizes the Expected Out-of-Sample UtilityResearch Paper

Mean-variance analysis (Markowitz, 1952) tells an investor which portfolio to hold once the mean vector μ\muμ and covariance matrix Σ\SigmaΣ of asset returns are known. In practice both are estimated from a finite window of past returns, and the portfolio built from the estimates (the plug-in portfolio) performs badly out of sample: its weights are noisy and…

11 thms1 active userReviewed
Algorithmic Game TheoryConvex OptimizationEconomics+1·Captain: mikedeng1

Infinite-Dimensional Fisher Markets and Tractable Fair Division 1: The Eisenberg–Gale Programs Attain Their Optima, One at a Pure Allocation, and Optimal Pairs Are Exactly the Market EquilibriaResearch Paper

A Fisher market divides a supply of goods among buyers with fixed budgets. In a finite market, each good is a separate coordinate. Fair division can instead involve a continuum of items, such as locations along an interval or points in a region, where a buyer's valuation varies measurably from point to point. Finite dimensional existence and duality…

9 thms1 active userReviewed
EconomicsProbabilityStatistics·Captain: mikedeng1

Quantifying the Impact of Impact Investing II: Moments of Impact-Ranked Omitted-Factor Returns under Cross-Sectionally Correlated Gaussian Impact FactorsResearch Paper

Impact investing selects securities by a non-financial score, an ESG rating, a carbon intensity, a measure of social benefit, and asks whether such a selection earns an excess return. A. W. Lo and R. Zhang (SSRN 3944367; published in Management Science, DOI 10.1287/mnsc.2022.01168) model the score as an impact factor XXX and study the returns of securities ran…

6 thms1 active userReviewed
AnalysisControl TheoryEconomics+1·Captain: mikedeng1

Punish Underperformance with Suspension: Optimal Dynamic Contracts in the Presence of Switching Cost I: Condition 1, High Switching Cost, Not-Hiring Value Functions Meet the Optimality ConditionsResearch Paper

Many service relationships let a firm pause an agent instead of firing them: a sales representative who brings in no customers for a while is suspended, a contractor is laid off for a season and recalled. Pausing is not free. Every restart carries a switching cost KKK (re-training, re-establishing a territory, setting up the work environment), so a principal…

11 thms1 active userReviewed
ProbabilityStatistics·Captain: mikedeng1

Design and Analysis of Switchback Experiments 2: Under the Optimal Design the Horvitz–Thompson Estimator Is Asymptotically Normal as the Number of Epochs n → ∞Research Paper

Online platforms such as ride-hailing, delivery and marketplace companies routinely test a new policy (a pricing rule, a dispatching algorithm) by switching it on and off over time on a single unit, a city or a market, rather than by randomizing over users. These switchback experiments avoid the interference that user-level randomization creates in…

9 thms1 active userReviewed
Markov ChainNumerical AnalysisProbability+1·Captain: mikedeng1

Multilevel Langevin Pathwise Average for Gibbs Approximation III: C² Strongly Contractive Drift, 𝔞 = 2 — L²-Error ≲ [f]₁ε at Cost ((½+√2)/(√2−1))Υ₂²log(γ₀⁻¹)ε⁻²/(γ₀α)Research Paper

Sampling from a Gibbs distribution πU∝e−U dλd\pi_U\propto e^{-U}\,d\lambda_dπU​∝e−Udλd​ on Rd\mathbb R^dRd is a basic task in Bayesian statistics, statistical physics and machine learning. A standard approach simulates the Langevin diffusion dXt=−∇U(Xt) dt+2 dBtdX_t=-\nabla U(X_t)\,dt+\sqrt2\,dB_tdXt​=−∇U(Xt​)dt+2​dBt​, whose invariant distribution is πU\pi_UπU​, through its Euler scheme, and averages a test function fff along…

16 thms1 active userReviewed
Control TheoryEconomicsPartial Differential Equations+1·Captain: mikedeng1

A Dynamic Principal Agent Problem with One-sided Commitment: The Principal's Value Function Is the Minimal Continuous Viscosity Solution of the Type-Indexed HJB SystemResearch Paper

In a principal–agent problem with moral hazard, a principal (an employer) pays an agent whose effort she cannot observe; she sees only an output process whose drift the effort controls. Continuous-time versions of the problem, starting with Holmström–Milgrom (1987) and Sannikov (2008), are solved by turning the agent's continuation utility into a state…

17 thms1 active userReviewed
Control TheoryOperations ResearchProbability+1·Captain: mikedeng1

Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model: Optimal MMV and MV Utilities Coincide If and Only If Assumption 1 HoldsResearch Paper

Mean-variance (MV) preferences, Uθ(X)=E[X]−θ2Var(X)U_\theta(X)=\mathbb E[X]-\frac\theta2\mathrm{Var}(X)Uθ​(X)=E[X]−2θ​Var(X), are the standard objective of portfolio selection since Markowitz. They are not monotone: an investor can prefer a terminal wealth XXX to a wealth X′≥XX'\ge XX′≥X that is larger in every state, because the extra upside raises the variance. Monotone mean-variance (MMV) preferences (Ma…

15 thms1 active userReviewed
Markov ChainNumerical AnalysisProbability+1·Captain: mikedeng1

Multilevel Langevin Pathwise Average for Gibbs Approximation II: Strongly Contractive Drift, 𝔞 = 1 — L²-Error ≲ [f]₁ε at Cost (5log γ₀⁻¹/2αγ₀)Υ₁²ε⁻²⌈log₂(Υ₁²ε⁻²)⌉³Research Paper

Sampling from a Gibbs distribution πU∝e−U dλd\pi_U \propto e^{-U}\,d\lambda_dπU​∝e−Udλd​ on Rd\mathbb R^dRd, or computing integrals π(f)\pi(f)π(f) against it, is a basic task of Bayesian statistics, statistical physics and stochastic optimization. A standard route is to simulate a diffusion whose invariant law is the target, for instance the overdamped Langevin equation …

15 thms1 active userReviewed
Control TheoryPartial Differential EquationsStochastic Systems·Captain: mikedeng1

Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking: Verification Theorem for the Optimal Feedback Investment-Consumption StrategyResearch Paper

A fund manager who tracks a benchmark (a stock index, a price index, the cost of higher education) wants the managed wealth to stay above the benchmark at all times. Under a strict floor constraint Vt≥MtV_t\ge M_tVt​≥Mt​ the set of admissible strategies can be empty when the benchmark is random. Bo, Huang and Yu (arXiv:2302.08302, Math. Oper. Res.) relax the…

22 thms1 active userReviewed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria 4: For Subadditive Cancelable Valuations Every α-Approximate Pure Nash Equilibrium of Round-Robin Is α/2-EF1Research Paper

Round-Robin is the simplest procedure for dividing indivisible goods: agents take turns, in a fixed cyclic order, each picking a favourite among the goods still available. When agents have additive valuations and pick truthfully, the resulting allocation is envy-free up to one good (EF1): no agent prefers another agent's bundle once a single good is removed…

7 thms1 active userReviewed
Mathematical PhysicsPartial Differential EquationsProbability+1·Captain: mikedeng1

Global-in-Time Mean-Field Convergence for Singular Riesz-Type Diffusive Flows 2: A Uniform-in-Time Modulated-Energy Bound for Globally Superharmonic Riesz-Type PotentialsResearch Paper

Systems of many particles that interact through a singular pair potential and are subject to independent noise appear in plasma physics (Coulomb interactions), in vortex models of fluids, in models of collective behaviour and in the analysis of training dynamics of wide neural networks. When the number of particles NNN is large, the empirical measure of the…

14 thms1 active userReviewed
Mathematical PhysicsPartial Differential EquationsProbability+1·Captain: mikedeng1

Global-in-Time Mean-Field Convergence for Singular Riesz-Type Diffusive Flows 1: The Expected Modulated Energy Grows at Most Polynomially in TimeResearch Paper

Systems of NNN particles that interact through a singular pair potential and are driven by independent noise are used to model vortices in viscous fluids, collective motion of micro-organisms, aggregation phenomena and, more recently, the training dynamics of wide neural networks and stochastic gradient methods. When NNN is large, one expects the empirical…

14 thms1 active userReviewed
Optimal TransportOptimizationProbability+1·Captain: mikedeng1

Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization 1: The Gelbrich Minimax and Normal-Prior Maximin Values Coincide (Sandwich Theorem)Research Paper

Estimating an unknown parameter from a noisy linear measurement is the basic problem behind Kalman filtering, signal recovery and linear inverse problems. A Bayesian statistician picks the estimator that minimizes the mean square error under a prior distribution; a minimax statistician guards against the worst prior in some family. The Bayesian answer…

15 thms1 active userReviewed
AnalysisPartial Differential EquationsProbability+1·Captain: mikedeng1

Diffusion Approximation for Fully Coupled Stochastic Differential Equations 1: The Parametric Poisson Equation Has a Unique Centered Solution with Optimal Regularity in x and yResearch Paper

Poisson equations for the generator of an ergodic diffusion are a standard tool in stochastic averaging, homogenization and diffusion approximation: to show that a fast ergodic component averages out in a slow equation, one writes the fluctuation f(Xt,Yt)f(X_t,Y_t)f(Xt​,Yt​) as L0u\mathscr L_0 uL0​u and applies Itô's formula to uuu. This requires a solution uuu whose regularity is…

8 thms1 active userReviewed
Calculus of VariationsFunctional AnalysisOptimization·Captain: mikedeng1

Nonlinear Quasi-hemivariational Inequalities: Existence and Optimal Control: Existence of Solutions to the Generalized Quasi-Hemivariational InequalityResearch Paper

Hemivariational inequalities were introduced by Panagiotopoulos in the 1980s to model mechanical problems whose energy functional is neither convex nor smooth: nonmonotone friction, adhesion, delamination and unilateral contact with nonmonotone multivalued laws. Where a variational inequality expresses the optimality condition of a convex energy, a…

16 thms1 active userReviewed
Control TheoryDynamic ProgrammingPartial Differential Equations+1·Captain: mikedeng1

Viscosity Solutions to Parabolic Master Equations and McKean–Vlasov SDEs with Closed-Loop Controls 3: The Closed-Loop McKean–Vlasov Value Function Is a Viscosity Solution of the HJB Master EquationResearch Paper

Mean field control asks a central planner to steer a large population of interacting agents. Each agent's state follows a stochastic differential equation whose coefficients depend on the agent's own state and on the empirical distribution of the population; as the population grows, the system is described by a single McKean–Vlasov equation whose…

18 thms1 active userReviewed
Optimal TransportPartial Differential EquationsProbability·Captain: mikedeng1

Viscosity Solutions to Parabolic Master Equations and McKean–Vlasov SDEs with Closed-Loop Controls 1: A Functional Itô Formula for Path-Dependent Functionals of Semimartingale LawsResearch Paper

Master equations are partial differential equations whose state variable is a probability measure. They arise as the Hamilton–Jacobi–Bellman equations of mean field control problems, where a planner steers a large population through its distribution, and as the limit description of large games. Their basic computational tool is an Itô formula for functions…

14 thms1 active userReviewed
CombinatoricsLinear OptimizationOptimization·Captain: mikedeng1

The Running Intersection Relaxation of the Multilinear Polytope 3: Running Intersection Inequalities Meeting Three Support Conditions Define Facets of the Multilinear PolytopeResearch Paper

Binary polynomial optimization asks for the maximum of a polynomial over {0,1}n\{0,1\}^n{0,1}n. Linearizing each monomial ∏v∈ezv\prod_{v\in e}z_v∏v∈e​zv​ by a new variable zez_eze​ turns the problem into a linear program over the convex hull of a set of 0/1 points, the multilinear polytope of the hypergraph whose edges are the monomials. Global solvers such as BARON build polyhedral…

6 thms1 active userReviewed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Arbitrage and Duality in Nondominated Discrete-Time Models II: Nondominated Optional Decomposition — a Supermartingale Under Every Martingale Measure Is V₀ + H•S − KResearch Paper

In a financial market with a single probability model, the Optional Decomposition Theorem describes the processes that can be dominated by trading. If a process VVV is a supermartingale under every equivalent martingale measure, then it can be written as an initial value plus a stochastic integral against the stock price, minus an increasing process that…

10 thms1 active userReviewed
Control TheoryPartial Differential EquationsProbability·Captain: mikedeng1

Viscosity Solutions to Parabolic Master Equations and McKean–Vlasov SDEs with Closed-Loop Controls 2: Comparison Principle and Uniqueness for Viscosity Solutions of Parabolic Master EquationsResearch Paper

Master equations are partial differential equations whose state variable is a probability measure. They arise as the dynamic programming equations of mean-field control problems, as the limits of large particle systems, and as the pricing equations of options on a whole population. Their coefficients and solutions are functions on a Wasserstein space, which…

15 thms1 active userReviewed
Algorithmic Game TheoryDynamic ProgrammingProbability+1·Captain: mikedeng1

Approximate Markov-Nash Equilibria for Discrete-Time Risk-Sensitive Mean-Field Games 2: The Mean-Field Equilibrium Policy Is an ε-Markov-Nash Equilibrium of Every Large Enough N-Agent GameResearch Paper

Games with many interacting agents, such as traffic participants, users of a shared communication channel or firms in a market, are rarely solvable exactly: a Nash equilibrium of an NNN-player stochastic game requires each agent to track the whole population, and its computation grows with NNN. Mean-field game theory replaces the population by its limiting…

16 thms1 active userReviewed
Dynamical SystemsProbabilityStochastic Systems·Captain: mikedeng1

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 1: The Spatially Structured McKean–Vlasov Delay Equation with Jumps Is Well-PosedResearch Paper

Networks of conductance-based neurons, such as FitzHugh–Nagumo networks, are modelled by systems of stochastic differential equations in which each neuron interacts with the others through synapses, and the signal from one neuron reaches another only after a transmission delay. Biological neurons sit at positions in space, belong to a few distinct subpopulat…

17 thms1 active userReviewed
PreviousPage 45 of 52Next

Top contributors

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