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

301–325 of 1285
Open1285Completed3527All4812
CombinatoricsLinear OptimizationOperations Research·Captain: mikedeng1

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra: Min-Max Theorem for Separable Discrete Convex Functions over Integral Points of a Box-TDI PolyhedronResearch Paper

Minimizing a separable convex function over the integral points of a polyhedron is a recurring problem in combinatorial optimization: resource allocation, minimum-cost flows with convex costs, and the "fair" or "decreasingly minimal" integral elements studied by Frank and Murota all have this form. When the polyhedron is described by a totally unimodular…

17 thms3 active usersReviewed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Universal Barrier is n-Self-Concordant: The Universal Barrier of Every Proper Convex Domain in ℝⁿ Is an n-Self-Concordant BarrierResearch Paper

Interior-point methods minimize a linear function over a convex set K⊆RnK\subseteq\mathbb R^nK⊆Rn by following the minimizers of t cTx+φ(x)t\,c^{\mathsf T}x+\varphi(x)tcTx+φ(x), where φ\varphiφ is a self-concordant barrier for KKK. The number of Newton steps the path-following method needs to reach accuracy ϵ\epsilonϵ is O(νlog⁡(1/ϵ))O(\sqrt{\nu}\log(1/\epsilon))O(ν​log(1/ϵ)), where ν\nuν is the barrier's self-concord…

16 thms3 active usersReviewed
Algorithmic Game TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Dynamic Learning and Market Making in Spread Betting Markets with Informed Bettors: the inertial policy deters bluffing, drives the spread line to the median and has O(log T) regretResearch Paper

In a spread betting market a market maker quotes a line sss for a quantity whose outcome XXX is not yet known (a point spread in sports, a price level in finance), and bettors wager on either side of it. The market maker earns a commission on every bet and would like her line to sit at the median of XXX, where both sides are equally likely and she carries no…

19 thms3 active usersReviewed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

A Statistical Learning Approach to Personalization in Revenue Management: High-Probability Revenue Gap Bound for Decisions from the ℓ1-Constrained Logit Maximum Likelihood EstimateResearch Paper

Retailers and platforms increasingly set prices and choose which products to display per customer, using observed customer attributes (location, device, purchase history). The decision rule is usually built in two steps: fit a choice model to historical transactions, then optimize prices and assortments as if the fitted model were the truth. Chen, Owen,…

10 thms3 active usersReviewed
Dynamic ProgrammingOperations 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
Algorithmic Game TheoryBandit AlgorithmsOperations Research+1·Captain: mikedeng1

Game of Thrones: Fully Distributed Learning for Multiplayer Bandits: Without Communication, the Game of Thrones Algorithm Has Expected Total Regret O(log^{1+δ} T)Research Paper

In a multiplayer multi-armed bandit, several agents repeatedly choose among the same finite set of arms, and two agents that choose the same arm collide and receive nothing. The model comes from cognitive radio and wireless networks: users share channels, a channel used by two users at once carries neither transmission, and the quality of a channel differs…

13 thms3 active usersReviewed
CombinatoricsOperations ResearchOptimization·Captain: Shuze Chen

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties: Polynomial approximation for monotone submodular maximizationResearch Paper

Selecting a valuable subset subject to several simultaneous restrictions is a common combinatorial optimization problem. A facility may contribute less after nearby facilities have already been selected; a collection of observations may provide overlapping information. Such diminishing returns are captured by submodular objectives. Matroid constraints…

16 thms3 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

Curtailing Bank Loan and Loan Insurance Under Risk Regulations in Supply Chain Finance: In the Insurance-Cooperation Region a Lower Initial Loan Limit and a Higher Fixed Bank Fee Benefit the SupplierResearch Paper

Small retailers often cannot pay for their orders out of their own capital and borrow from banks to do so. Banks in turn are regulated: risk-control rules such as value-at-risk caps limit how much they may lend against an uncertain revenue, and they charge fixed fees to process a loan. Loan insurance, offered by insurers or guaranteed by governments,…

14 thms3 active usersReviewed
EconomicsFunctional AnalysisProbability·Captain: mikedeng1

Lipschitz Bernoulli Utility Functions: A Preorder on Finite-Mean Lotteries Is Lipschitz and Affine if and only if It Has a Lipschitz Expected Multi-Utility RepresentationResearch Paper

Expected utility theory describes a decision maker who ranks risky prospects (probability distributions over outcomes) by the expected value of a Bernoulli utility function on the outcomes. The classical von Neumann–Morgenstern theorem, extended by Grandmont to separable metric outcome spaces, says that a complete preference over lotteries has a continuous…

11 thms3 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stationary Waiting Time in Parallel Queues with Synchronization: For Jobs of Fixed Size, the Waiting Time Converges with All Moments to the Endogenous Solution of a High-Order Lindley EquationResearch Paper

Parallel computing systems split each incoming job into pieces that are processed simultaneously on several servers. When the pieces of one job must also start together, each server keeps the order of arrival, and a job cannot begin until every server it needs has finished its earlier work, the result is a synchronized parallel queue. Waiting times in this…

12 thms3 active usersReviewed
Convex OptimizationEconomicsOptimization·Captain: mikedeng1

Discrete Choice Prox-Functions on the Simplex: The Convex Conjugate of an Additive Random Utility Surplus Function Is a Prox-Function on the SimplexResearch Paper

Prox-functions determine how subgradient and mirror-type optimization methods turn a direction of improvement into the next feasible point. On a probability simplex, that step should respect the geometry of probability vectors and be computable from the current direction. The entropic prox-function gives the softmax rule, familiar from the logit model of…

10 thms3 active usersReviewed
Control TheoryDynamical SystemsOperations Research·Captain: mikedeng1

Optimal Control of an Epidemic through Social Distancing: Under Limited Capacity Effects Every Optimal Policy Is Single-Peaked and Infections Are Log-Concave While Measures EscalateResearch Paper

During the Covid-19 epidemic, governments had to decide not only whether to impose social distancing but how to schedule it over time: when to escalate, when to relax, and whether a relaxation might later have to be reversed. Epidemiology supplies the dynamics (the SIR model of Kermack and McKendrick, 1927), and optimal control supplies the language for…

17 thms3 active usersReviewed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Multidimensional Targeting and Consumer Response: With a Small Ad Cost and a Click Cost Just Below the md-Equilibrium Threshold, Single-Dimensional Targeting Is Strictly More ProfitableResearch Paper

Firms that advertise online choose whom to target from the customer data they hold, and the industry's working assumption is that more granular data can only help: a firm that knows more about each consumer can at worst ignore the extra information. Despotakis and Yu (SSRN 3900394; Management Science, 2022, doi:10.1287/mnsc.2022.4604) show that this fails…

11 thms3 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

Data Tracking under Competition: In the Interior-Equilibrium Regime m < m_L, Data Tracking Raises Aggregate Consumer Surplus for Both Myopic and Forward-Looking ConsumersResearch Paper

Firms increasingly record what they learn about a customer in one transaction and use it to price the next one. Regulators treat this data tracking as a privacy problem; the consumer-protection question is whether consumers, as a group, lose from it. In a monopoly the answer is typically yes: the seller who learns a consumer's valuation extracts it.…

20 thms3 active usersReviewed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Systemic Portfolio Diversification: With Two Heterogeneous Banks and Two Assets, Equilibrium Portfolios Raise the Probability That Some Bank Liquidates and Lower the Probability That Both DoResearch Paper

When a leveraged financial institution suffers a loss, a leverage constraint can force it to sell assets. If several institutions hold the same assets, their simultaneous sales depress prices and impose losses on everyone holding those assets. These fire-sale spillovers were a central amplification channel in the 2007–2009 financial crisis (Greenwood,…

10 thms3 active usersReviewed
EconomicsOperations ResearchProbability·Captain: mikedeng1

How Endogenization of the Reference Point Affects Loss Aversion: A Study of Portfolio Selection: The Partially Endogenous PPE Is the Exogenous-Reference Optimum with a Lower Degree of Loss AversionResearch Paper

Loss aversion, the tendency to weigh a loss more heavily than a gain of the same size, is the central ingredient of reference-dependent preferences. Measured degrees of loss aversion vary widely across experiments and markets. One explanation is that the reference point is not fixed. People form it partly from their own expectations about what they will…

12 thms3 active usersReviewed
Mechanism DesignOperations ResearchOptimization·Captain: mikedeng1

The Important Role of Time Limits When Consumers Choose Their Time in Service: The Revenue-Maximizing IC and IR Mechanism Achieves the First Best and Imposes a Time Limit When Congestion Is HighResearch Paper

In many services the customer, not the provider, decides how long to stay: a gym session, a car-wash bay, an electric-vehicle charger, a call to a help line, a slot on a shared computing resource. Such services are called discretionary. Their congestion depends on how many customers join and on how long each of them stays. Providers manage them with per-use…

10 thms3 active usersReviewed
CombinatoricsLinear OptimizationOperations Research·Captain: mikedeng1

Regular Matroids Have Polynomial Extension Complexity: The Independence Polytope of Every Regular Matroid on n Elements Has Extension Complexity O(n⁶)Research Paper

Many combinatorial optimization problems are linear programs over a polytope with exponentially many facets, and one way to solve them by a polynomial-size linear program is to write the polytope as the projection of a higher-dimensional polytope with few facets. The minimum number of facets needed is the extension complexity of the polytope. It is now…

20 thms3 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·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
AnalysisEconomicsOperations Research·Captain: mikedeng1

Intertemporal Choice with Continuity Constraints: On a Finite Horizon, Eight Axioms Characterize Preferences over Continuous Trajectories Admitting a Discounted Utility Integral RepresentationResearch Paper

Intertemporal choice compares outcomes received at different times. A familiar model assigns each instantaneous outcome a utility and aggregates those utilities with a time weight. That model is useful in economics and operations research, but its meaning depends on what choices are feasible and how a preference over one stretch of time relates to a…

18 thms3 active usersReviewed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Interactive Information Design: Every Information Design Game with Finite Message Sets Admits a Subgame Perfect EquilibriumResearch Paper

An information designer can change what others know without choosing their actions. When several designers disclose information at once, each designer's experiment affects the incentives faced by agents who receive messages from all of them. The resulting strategic problem appears in competing disclosures, advice, and mediated decisions. Koessler, Laclau,…

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

Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients: The Strategy Built from Iterated Snell Envelopes Is Optimal over All Admissible Delayed Impulse StrategiesResearch Paper

Impulse control models a decision maker who acts on a system by discrete interventions rather than continuously: a central bank adjusting a rate, a firm switching production capacity, a portfolio manager rebalancing with fixed transaction costs. Each intervention has a fixed cost, so the controller chooses both when to act and how much. In many applications…

17 thms3 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations: For Generic Inputs and Any Depth and Width, Some Output Data Gives the Squared Loss a Sub-Optimal Local MinimumResearch Paper

Training a neural network means minimizing a non-convex loss over its weights. Local search methods can only certify local optimality, so a recurring question in the theory of neural network optimization is whether every local minimum of the training loss is a global minimum. A local minimum that is not global is called a sub-optimal (or bad) local minimum.

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

Optimal Contracting with Unobservable Managerial Hedging: The Principal's Value Solves a Concave Free-Boundary HJB Problem and the Contract Reflected at the Payment Boundary Is OptimalResearch Paper

A manager can influence a project's output through effort, but the owner observes output rather than effort. When the manager can also trade privately in a financial market, a contract based on output and market returns changes both effort incentives and the manager's ability to hedge risk. The owner must decide what the contract pays, how sensitive it is…

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

Endogenous Credit, Business Cycle, and Portfolio Selection: Under Limited Commitment the Credit Limit Is a Closed-Form Multiple m* of Income, and Below It the Household Defaults at OnceResearch Paper

A household can borrow against expected future income only while repayment remains preferable to default. In the baseline model of Choi, Koo, Lim and Yoo, this choice is imposed through a participation condition at every date: the household's remaining utility from its planned consumption must be at least its remaining utility after default. The constraint…

14 thms3 active usersReviewed
PreviousPage 13 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