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.

3527 completed missions

Missions

1326–1350 of 3527
Open1285Completed3527All4812
🏆Completed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria 1: For Cancelable Valuations the Bluff Profile Is an Exact Pure Nash Equilibrium of Round-RobinResearch Paper

Round-Robin is the simplest allocation procedure for indivisible goods: agents take turns, in a fixed order, and at each turn the active agent takes her favourite good among those still available. Run on truthful preferences with additive valuations it returns an allocation that is envy-free up to one good (EF1), which is why it is the default baseline of…

6 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Self-Preferencing and Search Neutrality in Online Retail Platforms I: Under a Low Commission, Search Neutrality Strictly Reduces Consumer Surplus When the Two Products Are Similarly PopularResearch Paper

Large retail platforms both host independent sellers and sell their own products, and they control the order in which products appear in search results. When the platform ranks its own product first regardless of relevance, it engages in self-preferencing. Regulators have treated this as a competition problem: the European Commission opened a second…

15 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Self-Preferencing and Search Neutrality in Online Retail Platforms II: At Equal Popularity, a Commission Below ρL/ρH Makes Search Neutrality Lower Consumer Surplus and Raise the Third-Party ProfitResearch Paper

Large retail platforms such as Amazon both host independent sellers and sell their own products in competition with them. The platform also controls the search ranking, the order in which products are shown to a consumer. The European Commission and the US Federal Trade Commission have examined whether platforms rank their own products ahead of rivals' (self…

8 thms3 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

Asset Pricing with Costly Short Sales 1: The Lending Agent Charges Half the Pessimist's Frictionless Sharpe Ratio, and Lending Is Active Exactly When Her Net Sharpe Ratio Is NegativeResearch Paper

To sell a stock short, an investor must first borrow it, and the owner who lends it charges a lending fee. Securities lending is a large market, and the fee varies across stocks: D'Avolio (2002) documents that shorting costs are positively related to the dispersion of investors' beliefs. Short-sale constraints have a long history in asset pricing (Miller…

6 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 2: With Zero Lead Time and Minimal Disposal, Two Myopic Solutions Bound the Optimal Order-Up-To LevelResearch Paper

Food, blood products, pharmaceuticals and many retail goods are perishable: a unit is usable for a fixed number of periods and is then discarded. A seller of such a product decides every period how much to order, what price to charge, and how much stock to deplete or dispose of. Because units of different ages coexist, the state of the system is a vector of…

10 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingMachine LearningOperations Research+1·Captain: mikedeng1

The Role of Lookahead and Approximate Policy Evaluation in Reinforcement Learning with Linear Value Function Approximation: Error Bound for Least-Squares Policy Iteration with LookaheadResearch Paper

Approximate policy iteration is the template behind most practical reinforcement-learning systems for large state spaces: alternate between choosing a policy that looks good under the current value estimate and estimating the value of that policy, with errors in both steps. Game-playing systems such as AlphaZero add two ingredients to this template: a…

19 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchOptimization·Captain: mikedeng1

The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment: Ψ-Pairwise Alignment Yields a Replenishment Policy Within Factor 1 + 5ϵ of Any PolicyResearch Paper

The joint replenishment problem is a basic model of coordinated inventory control. A firm stocks nnn commodities, each of which follows its own Economic Order Quantity (EOQ) model, but every order also incurs a joint ordering cost K0K_0K0​, regardless of which commodities it contains. Ordering commodities together therefore saves money, and the question is how to…

19 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+2·Captain: mikedeng1

Corruption-Robust Exploration in Episodic Reinforcement Learning II: Uniformly Action-Eliminating Algorithms Suffer Expected Regret at Least K/8 for K ≤ A^H/4Research Paper

In stochastic multi-armed bandits, a robust way to explore is action elimination: keep confidence intervals for every arm, discard an arm once its upper confidence bound falls below another arm's lower confidence bound, and sample uniformly among the arms that survive. Uniform sampling is what makes the first corruption-robust bandit algorithm work (Lykouris…

10 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingNumerical AnalysisOperations Research+1·Captain: mikedeng1

Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme: The Quasi-Variational Inequality with Inspection Operator Has a Unique Bounded SolutionResearch Paper

In many sequential decision problems the state of a system is not observed for free. A controller monitoring a machine, a patient or an inventory must pay to inspect it, and between inspections it acts on a belief rather than on the state. The observation cost model (OCM) makes this precise for a finite Markov chain: at each time the controller either pays…

11 thms3 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

A Model of Shoppertainment Live Streaming: Zero Entertainment Bandwidth Is Never Optimal, the Optimal Bandwidth Lies Beyond the Traffic Peak, and Is Full Entertainment When vₑ > v(1+q)/4Research Paper

In shoppertainment live streaming a single streamer sells products from many manufacturers during live sessions that mix product presentation with entertainment. Some of the most successful streamers spend much of their air time on content unrelated to the products; the paper cites Dong Yuhui, who devotes his sessions to English lessons. Traditional TV…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 1: With Backlogging, the Profit-to-Go Is L♮-Concave and the Optimal Policy Is Monotone with Bounded SensitivityResearch Paper

Food, blood and pharmaceuticals are perishable: a unit not sold within its lifetime is thrown away. A seller decides each period how much to order, which price to charge, and whether to dispose of stock early. A large stock of old units argues for a lower price and a smaller order.

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming: Individual Chance Constraints over Markov Ambiguity Sets Are Finite Conic SystemsResearch Paper

Many engineering and operations problems must guarantee that a system operates safely with high probability, when the uncertain parameters z~\tilde zz~ are only partially known. A chance constraint asks that the safety condition Sz~≤tS\tilde z \le tSz~≤t hold with probability at least 1−ϵ1-\epsilon1−ϵ for a tolerance ϵ∈(0,1)\epsilon \in (0,1)ϵ∈(0,1). When the distribution of z~\tilde zz~ is…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs 2: Subdifferential of the Value Function of a Convex ProgramResearch Paper

Stochastic dual dynamic programming (SDDP) and related decomposition methods solve multistage stochastic programs by approximating each stage's recourse function from below by a maximum of affine cuts. Every cut needs a value and a slope: the value of a convex subproblem at a trial point, and a subgradient of that subproblem's optimal value as a function of…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization III: SAKKT-Regularity Is the Weakest Strict Constraint Qualification for SAKKTResearch Paper

Algorithms for smooth constrained optimization stop when an approximate optimality test passes. The tests used in practice are sequential optimality conditions: properties of a sequence of iterates xk→x∗x^k\to x^*xk→x∗ rather than of the limit point alone. Every local minimizer satisfies them, with or without a constraint qualification. The price is that a point…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Prophet Secretary Through Blind Strategies 2: No Stopping Strategy Can Guarantee More Than √3 − 1 of the Prophet's Expected Maximum in Random OrderResearch Paper

In a prophet inequality a gambler sees the realizations of independent nonnegative random variables one at a time and must decide irrevocably, at each step, whether to stop and keep the current value. Her performance is compared with that of a prophet who sees everything in advance and takes the maximum. The ratio between the two is the standard benchmark…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization II: AGP-Regularity Is the Weakest Strict Constraint Qualification for AGPResearch Paper

Algorithms for smooth constrained optimization stop when an approximate optimality test passes. The tests used in practice are sequential optimality conditions: properties of a sequence of iterates xk→x∗x^k\to x^*xk→x∗ rather than of the limit alone. Every local minimizer satisfies them, with or without a constraint qualification, which makes them natural stopping…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamic ProgrammingOperations Research+2·Captain: mikedeng1

On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs 2: Under τ-Admissible Random Node Selection, Cuts Become Exact Almost Surely at Every Tree NodeResearch Paper

Stochastic dual dynamic programming (SDDP) and its relatives are the standard algorithms for multistage stochastic programs: hydro-thermal scheduling, energy storage and long-horizon capacity planning are solved with them in industry. They approximate each future cost function from below by a maximum of affine cuts, compute new cuts only at a few randomly…

16 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization I: MFCQ or a Full Active-Gradient Cone Is the Weakest Strict CQ for Scaled-AKKTResearch Paper

Practical algorithms for nonlinear programming do not stop at an exact Karush–Kuhn–Tucker (KKT) point; they stop when an approximate stationarity test passes. Sequential optimality conditions formalize what such tests certify: they are properties of a feasible point x∗x^*x∗ phrased through sequences xk→x∗x^k \to x^*xk→x∗ and multiplier estimates, and every local…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research+1·Captain: mikedeng1

Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation 2: SONATA with Push-Sum Converges R-Linearly over Time-Varying Directed GraphsResearch Paper

In distributed optimization a network of mmm agents minimizes a sum of private functions while each agent talks only to its neighbours. Applications include federated and decentralized learning, sensor networks and multi-robot systems, where the data cannot be pooled at one site. Many of these networks are directed (communication links are one-way, for…

13 thms3 active usersReviewed
🏆Completed
Control TheoryConvex OptimizationLinear algebra+1·Captain: mikedeng1

Quadratic Matrix Inequalities with Applications to Data-Based Control II: Matrix Finsler's Lemma — Z⁰ᵣ(N) ⊆ Zᵣ(M) iff M − αN ⪰ 0 for Some α ≥ 0Research Paper

Finsler's lemma (P. Finsler, 1937) states that for symmetric matrices M,N∈SnM,N\in\mathbb S^nM,N∈Sn, the quadratic form x⊤Mxx^\top Mxx⊤Mx is positive on every nonzero xxx with x⊤Nx=0x^\top Nx=0x⊤Nx=0 if and only if M−αN>0M-\alpha N>0M−αN>0 for some real α\alphaα. Together with the S-lemma of Yakubovich it is one of the basic tools for converting a statement about all vectors satisfying a quadratic…

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationOperations Research+1·Captain: mikedeng1

On Solving Multistage Stochastic Programs with Coherent Risk Measures: The Inner-Approximation Policy's Nested Risk-Adjusted Cost Is at Most the Upper Bound yResearch Paper

Multistage stochastic linear programs model decisions taken over time under uncertainty: reservoir releases in hydro-thermal scheduling, production and inventory plans, capacity expansion. Their standard solution method, stochastic dual dynamic programming (SDDP, Pereira and Pinto 1991), approximates each stage's cost-to-go function from below by cutting…

8 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations ResearchProbability·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures IV: The Comonotonic Inf-Convolution of Tail Risk Measures Is a Tail Risk Measure with the Maximal Tail ParameterResearch Paper

A risk sharing problem distributes an aggregate random loss XXX among nnn agents, each of whom evaluates its share with a risk measure ρi\rho_iρi​. The smallest achievable aggregate risk is the inf-convolution □i=1nρi(X)\square_{i=1}^n\rho_i(X)□i=1n​ρi​(X), and allocations that attain it are optimal. In insurance and in regulated banking the allocation is often required to be comonotonic:…

7 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations ResearchProbability·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures III: The Inf-Convolution of Tail Risk Measures Is a Tail Risk Measure with the Summed Tail ParameterResearch Paper

A risk measure assigns a number, typically a capital requirement, to a random financial loss. When a total loss XXX is shared among nnn agents, each judging its share by its own risk measure ρi\rho_iρi​, the smallest achievable aggregate risk is the inf-convolution

7 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchProbability+1·Captain: mikedeng1

Online Stochastic Matching: New Algorithms with Better Bounds 1: Every Random-Lists Algorithm Has ALG/OPT ≥ E[ALG]/E[OPT] − 2ε/(c+ε) with Probability at Least 1 − 2exp(−2nε²)Research Paper

Online bipartite matching with stochastic arrivals models the assignment of display-advertising impressions to advertisers: requests arrive one at a time, each must be assigned irrevocably on arrival or dropped, and the arrival sequence is random rather than adversarial. Since Feldman, Mehta, Mirrokni and Muthukrishnan beat the 1−1/e1 - 1/e1−1/e barrier in the i.i.d.…

5 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Product Price, Quality and Service Decisions under Consumer Choice Models VI: Consumer Surplus Rises as the Firm Also Controls Service Duration, and Again as It Also Controls QualityResearch Paper

A firm that sells differentiated products sets more than prices. It chooses quality levels (features, materials, reliability) and the ancillary services that come free with a product, such as a factory warranty or free maintenance for a fixed period. Wang, Ke and Cui (SSRN 3766191; Manufacturing & Service Operations Management, 2022, doi:10.1287/msom.2020.09…

9 thms3 active usersReviewed
PreviousPage 54 of 142Next

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