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.

3569 completed missions

Missions

2376–2400 of 3569
Open1243Completed3569All4812
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

The Joint Determination of Haircuts and Interest Rates for Collateralized Loans in Shadow Banking: Better Downside Collateral Quality Lowers the Haircut Iff E[ω | ω > ω*] > (e₀ − e₁)/KResearch Paper

Collateralized short-term loans, repurchase agreements above all, are the funding market of shadow banking. Each such loan carries two terms: an interest rate and a haircut, the fraction of the collateral's value that the lender does not finance. Studies of repo terms by collateral type around the 2007–2009 crisis (Gorton and Metrick, 2012; Krishnamurthy,…

12 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

On Time-Consistent Equilibrium Stopping Under Aggregation of Diverse Discount Rates: The Smallest One-Barrier Equilibrium Is the Optimal EquilibriumResearch Paper

A group that shares one stopping decision (a board deciding when to abandon an R&D project, a fund deciding when to exercise a real option) rarely shares one discount rate. A standard way to aggregate heterogeneous time preferences is to treat the discount rate ρ\rhoρ as random with law FρF_\rhoFρ​ and to average discounted payoffs over it. Weitzman (2001) showed…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationOperations Research+1·Captain: mikedeng1

Exact Penalization of Generalized Nash Equilibrium Problems: Under a Slater-Type Condition, Every Equilibrium of the ℓq-Penalized Nash Game Solves the Generalized Game for All Large PenaltiesResearch Paper

In a generalized Nash equilibrium problem (GNEP) each player's feasible set depends on the strategies of the other players. Such coupled constraints arise wherever players share a resource: transmission capacity in electricity and telecommunication markets, emission caps in environmental games, track time in railway pricing, road capacity in transportation…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Demand Shaping Through Bundling and Product Configuration: A Dynamic Multiproduct Inventory-Pricing Model: Under Bundle-to-Stock, the Optimal Policy Is Dictated by a No-Order SetResearch Paper

Firms that sell configurable products — computers, cable and phone packages, meal combos — decide not only how much to stock but also which bundles of components to offer and at what prices. Bundling decisions interact with inventory: offering a bundle draws on several items at once, and an overstocked item is a reason to push the bundles that use it. Song…

8 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchStatistics·Captain: mikedeng1

Herding in Probabilistic Forecasts: The Normal Forecast with the Morris–Shin Mean and Variance a(x−y)²+d Is an Equilibrium, Unique Among Polynomially Bounded ProfilesResearch Paper

Panels of professional forecasters — the European Central Bank's Survey of Professional Forecasters, the Federal Reserve's surveys, election and sports forecasters — increasingly report probabilistic forecasts: a whole predictive distribution rather than a single number. Aggregating such panels presumes that each forecast reflects the forecaster's own…

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Projectively Self-Concordant Barriers: Projective Self-Concordance with γ = (ν − 2)/√(ν − 1) Is Equivalent to Self-Concordance of the Logarithmically Homogeneous Extension ν(−log t + f(x/t))Research Paper

Interior-point methods for convex programming, introduced in their modern form by Nesterov and Nemirovski, run Newton's method on a barrier function of the feasible set. Their complexity analysis rests on a single analytic property of the barrier, self-concordance: the third derivative is controlled by the second, ∣F′′′(x)[h,h,h]∣≤2 (F′′(x)[h,h])3/2|F'''(x)[h,h,h]|\le 2\,(F''(x)[h,h])^{3/2}∣F′′′(x)[h,h,h]∣≤2(F′′(x)[h,h])3/2.…

10 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

If It Is Surely Better, Do It More? Implications for Preferences Under Ambiguity: Ambiguity Aversion Toward an Event Breaks Monotonicity in Optimal Mixtures for c-Linearly Biseparable PreferencesResearch Paper

Many economic and managerial decisions are choices of a mixing weight: how much effort to put on one sale rather than another, how much wealth to put in a risky asset, how to split a portfolio between two contracts. A natural comparative-statics requirement is that if one of the two options is improved in every state of the world, the decision maker should…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

A Single-Loop Algorithm for Decentralized Bilevel Optimization: O(1/K) Stationarity and Consensus Rates of SLDBO without Heterogeneity AssumptionsResearch Paper

Bilevel optimization chooses an upper-level variable xxx to minimize an objective that depends on the solution y∗(x)y^*(x)y∗(x) of a lower-level problem. Hyperparameter tuning and meta-learning are the standard examples (Franceschi et al. 2018; Ghadimi and Wang 2018). In the decentralized version the data are split among nnn agents. Each agent sees only its own upper-…

17 thms2 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Graphical Convergence of Subgradients in Nonconvex Optimization and Learning: Uniform Concentration of Empirical Bregman Proximal Points for Weakly Convex RisksResearch Paper

A learner who minimizes a regularized population risk

7 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityReinforcement Learning·Captain: mikedeng1

Relaxed Equilibria for Time-Inconsistent Markov Decision Processes: A Relaxed Equilibrium Exists in Discrete Time without Convexity, via Vanishing Entropy RegularizationResearch Paper

An agent who maximizes an expected sum of rewards over time is time-inconsistent when the plan that is optimal today stops being optimal tomorrow. This happens as soon as discounting is not exponential: with hyperbolic or quasi-hyperbolic discounting, a reward far in the future is weighed differently at time 0 and at time 1, and the agent's future selves…

15 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations ResearchProbability·Captain: mikedeng1

Optimal Subscription Planning for Digital Goods: Under Condition 2, a Single Grand Subscription Set With a Suitable Fee Achieves the Optimal RevenueResearch Paper

Digital-goods platforms (video, music, e-books, software) sell access in two ways at once: subscriptions, which give unlimited use of a set of items for a period, and rentals, which charge per use. A platform with a large catalogue could offer many subscription sets at different fees, but most platforms offer a single all-inclusive subscription. Alaei,…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear algebraOperations Research·Captain: mikedeng1

Analytical Solution to a Discrete-Time Model for Dynamic Learning and Decision Making: the two-action frontier difference equations have a unique closed-form solution with explicit det YResearch Paper

Many sequential decisions trade off immediate reward against information: a firm prices without knowing which demand regime it faces, a clinician treats without knowing a patient's type, a bandit player pulls a risky arm to learn its mean. Formally these are partially observed Markov decision problems (POMDPs) with a hidden but fixed state. Their value…

10 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

What Is the Impact of Nonrandomness on Random Choice Models?: Revenue-Ordered Assortments Are Optimal When One Product's Utility Is DeterministicResearch Paper

Retailers choose which products to show a customer, and the customer chooses at most one of them. The assortment problem asks for the offer set that maximizes expected revenue, given a model of how customers choose. Under the multinomial logit (MNL) model every alternative, the no-purchase option included, carries an independent Gumbel noise term of the…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Coordination for Assembly: With at Most M − 1 Feedback Periods, the Subgame-Perfect Secure Equilibrium Has Every Contractor Exert the Minimum Effort in Every PeriodResearch Paper

Assembly projects such as aircraft programs or large software releases split work among several contractors, each responsible for one component. The finished product can only be as advanced as its least-developed component, so the contractors play a minimum-effort game (also called a weakest-link game): the project's value depends on the minimum of the…

5 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On Policies for Single-Leg Revenue Management with Limited Demand Information: the Valuation Tracking Pricing Policy Is c*(P)-CompetitiveResearch Paper

Single-leg revenue management asks how a seller holding kkk units of a perishable item (seats on one flight leg, rooms for one night) should price or ration them to customers who arrive one at a time. The classical theory assumes a demand forecast. When no forecast is available, a standard robust criterion is competitiveness: an online policy is ccc-competitive…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Forewarned Is Forearmed? Contingent Sourcing, Shipment Information and Supplier Competition: Contingent Sourcing Makes Both Suppliers Weakly Better Off but Can Make the Buyer Worse OffResearch Paper

Firms that source from a low-cost but unreliable supplier often hedge with a second, reliable supplier. A recent development is that buyers can now track a shipment in transit (temperature loggers for perishables, GPS and inspection reports) and learn, before the selling season, whether the cheap order has been damaged. With that information the buyer can…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Near-Optimal Bayesian Online Assortment of Reusable Resources: the hybrid simulation-based algorithm is (1 − min{1/2, ε*(c_min)})-competitive against the Bayesian expected LPResearch Paper

Rental platforms, cloud computing, hotel and car-rental systems, and on-demand services all sell access to reusable resources: a unit that is rented comes back after a random rental duration and can be rented again. When such a platform displays a menu of products (an assortment) to each arriving customer, it faces an online decision problem: offering a…

15 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryBandit AlgorithmsMachine Learning+1·Captain: mikedeng1

V-Learning—A Simple, Efficient, Decentralized Algorithm for Multiagent Reinforcement Learning: Independent V-Learning Finds a Coarse Correlated Equilibrium with Gap O((H²S/K)Ξ(A,K/S,ι) + √(H⁵Sι/K))Research Paper

In multi-agent reinforcement learning several agents act in a shared, changing environment, each pursuing its own reward. The standard model is the Markov game (stochastic game), going back to Shapley (1953). When agents learn from experience rather than from a known model, the natural target is an equilibrium of the game, and the natural question is how…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Information Disclosure and Promotion Policy Design for Platforms: Under Myopic Pricing, the Long-Run Average Optimal Consumer Surplus Equals the Concavification of the Best Confounding SurplusResearch Paper

Online marketplaces decide which products to show first. A promotion puts a seller's product in front of consumers who will not search further, so it changes both the seller's sales and the surplus of the consumers who see it. A seller who is uncertain about the market sets prices from the sales they observe, and the platform's promotion decisions shape…

13 thms2 active usersReviewed
🏆Completed
Calculus of VariationsMachine LearningOptimization+1·Captain: mikedeng1

Game on Random Environment, Mean-Field Langevin System, and Neural Networks: First-Order Condition for Entropy-Regularized Minimization over Probability Measures with a Fixed MarginalResearch Paper

Several problems in machine learning and game theory are optimization problems over probability measures. Training a wide two-layer neural network can be viewed as minimizing a functional F(ν)F(\nu)F(ν) of the distribution ν\nuν of the network's parameters (Mei, Montanari, Nguyen, PNAS 2018; Hu, Ren, Šiška, Szpruch, arXiv:1905.07769). Adding a relative-entropy…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

On the Learning Benefits of Resource Flexibility: At the Break-Even Cost of Flexibility, the Flexible System Is More Profitable Below a Profit-Margin Threshold and Less Profitable Above ItResearch Paper

A firm that sells several products must decide, before demand is known, how much capacity to build. It can build dedicated capacity, one resource per product, or a single flexible resource that can serve any product but costs more per unit. The classical argument for flexibility is risk pooling: one pooled resource absorbs the fluctuations of several…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsLinear Optimization+1·Captain: mikedeng1

Fully Polynomial-Time Approximation Schemes for Fair Rent Division: Algorithm 1 on the Slope-Rounded Instance Halts in Polynomially Many Iterations with an ε-Envy-Free SolutionResearch Paper

Housemates who share a house must decide who gets which room and how the total rent is split. A solution pairs an assignment of rooms to agents with a rent for each room, and it is envy-free if no agent prefers another room at that room's rent. Envy-free rent division is the textbook example of fair division with money and is the mathematical core of…

14 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems: Optimal Values and Solutions of the Moreau-Regularized Problems Converge to Those of the Original ProblemResearch Paper

A chance constraint asks that a random inequality system hold with at least a prescribed probability ppp. Such constraints appear throughout engineering and energy optimization: reservoir and power-system management, network design, and any decision that must stay feasible against uncertain demand or inflow with high reliability. The function …

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location: The Coordinatewise Median with Predictions Is √(2c²+2)/(1+c)-Consistent and √(2c²+2)/(1−c)-RobustResearch Paper

Learning-augmented algorithms use a machine-learned prediction to perform better when the prediction is accurate, while keeping a worst-case guarantee when it is not. The two guarantees are called consistency (performance under a correct prediction) and robustness (performance under an arbitrary prediction). Agrawal, Balkanski, Gkatzelis, Ou and Tan (arXiv:2…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Experimenting in Equilibrium: Local Experimentation Consistently Estimates the Equilibrium Utility Gradient in the Mean-Field LimitResearch Paper

Online marketplaces (ride-sharing, delivery, freelance labour) set payments for their suppliers and want to know how a change in payment would change the platform's utility. The standard tool, a randomized A/B test, is biased in a marketplace: treated and control suppliers compete for the same demand, so a payment increase given to the treatment group draws…

13 thms2 active usersReviewed
PreviousPage 96 of 143Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5262500
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR37375594
5NINickrobbins953290156
6VEvebis25800
7FIfizzyinc321735
8SHshivm17520
9KMkmehltretter821002265
10SCShuze Chen9455327

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