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

2401–2425 of 3569
Open1243Completed3569All4812
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Optimal Priority-Based Allocation Mechanisms: In a Regular Market, Deferred Acceptance Implements Every Feasible Budget Set Probability Matrix, and DA-STB Exactly the Nested-Within-Segment OnesResearch Paper

School districts, public housing authorities and refugee resettlement agencies allocate scarce items (school seats, apartments, slots) without prices. Most such systems are priority-based: each applicant receives a priority, possibly depending on observable characteristics such as neighborhood or sibling status, and a mechanism such as deferred acceptance…

11 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationProbability·Captain: mikedeng1

From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation: Quasi-Arithmetic Pooling Is the Unique Report Maximizing the Worst-Case Profit Over Sub-Contracted ExpertsResearch Paper

Forecast aggregation asks how to combine several experts' probability forecasts for the same event into one forecast. The two classical answers are linear pooling (average the probability vectors) and logarithmic pooling (average the log-probabilities and renormalize). Neither is justified by the way forecasts are usually evaluated: with a proper scoring…

8 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationOperations Research·Captain: mikedeng1

Approximate Nash Equilibria in Large Nonconvex Aggregative Games: existence of a 2H((√q+1)MΔ/n)^γ-pure Nash equilibrium, built by Shapley–Folkman disaggregation of the convexified gameResearch Paper

Many large-population systems are modelled as aggregative games: each agent's cost depends on its own decision and on an average of everybody's decisions. Examples are electric-vehicle charging and demand response, where a household's cost depends on its own consumption profile and on the aggregate load through the electricity price, and congestion and…

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

Price Optimization Under the Finite-Mixture Logit Model: Branch-and-Bound over No-Purchase Probabilities Terminates with a (1 − ε)-Optimal Price VectorResearch Paper

A seller who offers nnn products and sets one price vector for all customers must price for a heterogeneous population. The finite-mixture logit (FML) model describes such a population with a small number of segments. Each segment follows its own multinomial logit (MNL) demand, so this is the simplest heterogeneous extension of the MNL model. It is widely…

9 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Assortment Rotation and the Value of Concealment: offering products sequentially in decreasing price order earns at least the optimal fixed assortment's revenueResearch Paper

Fast-fashion chains and flash-sale sites rotate their assortments: a product is on display for a short window and is then replaced. Retailers that do this face a choice that a classical assortment model cannot express. They can show the whole catalog at once, or they can conceal part of it and reveal products one at a time. In the classical discrete-choice…

8 thms2 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research·Captain: mikedeng1

Choice with Affirmative Action: every substitutable affirmative action rule that is monotonic in priority improvements and type changes admits a bounded reserve representationResearch Paper

Schools, universities and public employers that run affirmative action decide whom to admit from a set of applicants who are ranked by a priority ordering (exam scores, lottery numbers, seniority) and who belong to a minority or a majority group. The procedures used in practice, such as the reserve and quota systems of Boston, Chicago and New York school…

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

Incentive Design for Operations-Marketing Multitasking: mast-and-sail bonus plans are monotone in sales, and monotone in inventory exactly when mast and sail start togetherResearch Paper

A retail store manager does two kinds of work that the firm cannot observe directly: operational effort, which keeps shelves stocked, and marketing effort, which draws customers. The firm sees only the outcomes, namely how much inventory was available and how much was sold. Sales are the smaller of inventory and demand, so whenever the shelf runs empty the…

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

A Simple Rule for Pricing with Limited Knowledge of Demand: for every concave inverse demand the linear price (P_m + c)/2 earns at least half the optimal profitResearch Paper

A firm launching a new product (a drug, a software package, a digital download) must choose a price before it has data on its demand curve. Classical monopoly pricing needs the whole demand curve: the optimal price balances marginal revenue against marginal cost, and both depend on the curve's shape. Cohen, Perakis and Pindyck (Management Science; accepted…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online: GenSm-Main Is a Universally Truthful, Individually Rational, Budget-Feasible 505-Approximation MechanismResearch Paper

A buyer with a fixed budget wants to hire a team from a pool of sellers, each of whom knows privately what participating would cost them. The buyer values teams through a set function and pays each hired seller. The sellers are strategic: they report whatever cost serves them best. A budget-feasible mechanism decides whom to hire and what to pay so that…

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

Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming: With α = √T and σ = 1/√T, Expected Constraint Violation and Objective Regret Are O(√T)Research Paper

Many decision problems in operations research and machine learning ask to minimize an expected cost subject to constraints that also hold only in expectation: a portfolio with a bound on expected shortfall, a resource allocation whose expected load must stay below capacity, a classifier with an expected fairness constraint. The expectations are integrals…

13 thms2 active usersReviewed
🏆Completed
AnalysisDynamical SystemsOptimization·Captain: mikedeng1

Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions: A Bounded Subgradient Sequence That Does Not Converge for a Whitney-Stratifiable KŁ FunctionResearch Paper

The small-step subgradient method is the basic algorithm for minimizing a nonsmooth, nonconvex, locally Lipschitz function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R. It is also the scheme behind stochastic gradient training of neural networks with nonsmooth activations. From a starting point x0x_0x0​ it iterates

18 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Can Big Data Cure Risk Selection in Healthcare Capitation Program? A Game Theoretical Analysis: Informationally Perfect Capitation Rates Fail to Induce the Targeted Quality in EquilibriumResearch Paper

Medicare Advantage (MA) is the program in which the U.S. Centers for Medicare & Medicaid Services (CMS) pays private health plans a fixed amount per enrolled beneficiary, a capitation rate, instead of paying providers per service as in Traditional Medicare (TM). Capitation invites risk selection: a plan that receives a fixed payment per patient profits by…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Technical Note—Optimal Procurement in Remanufacturing Systems with Uncertain Used-Item Condition: Optimality of State-Dependent Noncongestive-Acquisition PoliciesResearch Paper

Remanufacturing restores used products (cores) to a sellable condition. Its economics depend on which cores are acquired: a core's condition is unknown until it has been collected, disassembled and inspected, and condition determines what remanufacturing costs. A remanufacturer who decides when to acquire cores therefore commits money before learning what…

7 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Changes in Risky Benefits and in Risky Costs: A Question of the Right Order: An Nth-Degree Risk Increase Lowers Exposure to a Risky Benefit, but to a Risky Cost Only When N Is EvenResearch Paper

Many decisions under uncertainty share one structure: a choice bbb scales the exposure to a random quantity X~\tilde XX~. A portfolio share scales the excess return of a risky asset, a coinsurance rate scales an uninsured loss, an output level scales a random price or a random cost. The linear-payoff model of Dionne, Eeckhoudt and Gollier (1993) covers all of…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics: Ergodic Kernels Increasing in the Own State and Decreasing in the Population State Allow at Most One Mean Field EquilibriumResearch Paper

Dynamic games with many players, such as dynamic oligopolies with investment, industry dynamics models, and heterogeneous-agent macroeconomic models of Bewley–Aiyagari type, are rarely tractable through Markov perfect equilibrium: the number of population states a player must track grows too fast with the number of players. Mean field equilibrium (MFE)…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchProbability+1·Captain: mikedeng1

The Power of Adaptivity for Stochastic Submodular Cover: With Independent Items, r Rounds of Adaptivity Achieve Expected Cost O(Q^{1/r} log Q) Times the Optimal Fully Adaptive CostResearch Paper

In many sequential decision problems an unknown quantity is revealed only when paid for: a medical test, a sensor reading, a database query. Stochastic submodular cover is the common abstraction: items are probed one at a time at a cost, each probe reveals a random outcome, and probing stops once the revealed outcomes jointly reach a coverage target. It…

14 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research+1·Captain: mikedeng1

Semidefinite Approximations for Bicliques and Bi-Independent Pairs: For Every Bipartite Graph, h(G) ≤ ½√g(G) ≤ h₁(G) ≤ ½√g₁(G) ≤ ¼α(G)Research Paper

A biclique in a graph is a pair of disjoint vertex sets (A,B)(A,B)(A,B) in which every vertex of AAA is adjacent to every vertex of BBB. Maximum-edge bicliques model problems in product manufacturing lines and formal concept analysis; balanced bicliques arise in VLSI design and in the analysis of biological data; and the maximum product ∣A∣⋅∣B∣|A|\cdot|B|∣A∣⋅∣B∣ over…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

How to Design a Stable Serial Knockout Competition: Scaling a Degree-Ordered Knockout Seeding on GF(2^k) by Each Nonzero Field Element Yields a Stable SKC on 2^k PlayersResearch Paper

A knockout tournament for n=2kn = 2^kn=2k players is played in kkk rounds: players are placed at the leaves of a complete binary tree, adjacent players meet in round 1, winners of adjacent matches meet in round 2, and the winner of round kkk, the final, wins the tournament. Who can meet whom, and in which round, is fixed entirely by the seeding, the order in which the…

6 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Size Matters, So Does Duration: The Interplay Between Offer Size and Offer Deadline: Optimal Offers Are Monotone in the Mean Residual Life Order of Alternative OffersResearch Paper

Job offers, purchase offers and admission offers usually come as a package: a size (salary, price, bonus) and a deadline after which the offer lapses. An exploding offer is one with a zero deadline: it must be accepted on the spot. Exploding offers are common in practice, in law-clerk hiring, in real-estate contracts, in flash sales, and they are often…

12 thms2 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Data Exploration by Representative Region Selection: Axioms and Convergence: Density Estimates from Arbitrarily Precise Families of RRS Methods Are Consistent in Integrated Absolute ErrorResearch Paper

Exploratory data analysis often summarizes a large data set by a small number of representative regions: histogram bins, the leaves of a density estimation tree, balls around cluster centres, or the regions chosen by a covering or kkk-center optimization. Estes, Ball and Lovell (SSRN 3005997; Mathematics of Operations Research, 2021, doi:10.1287/moor.2020.1115…

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

Sequential Product Development and Introduction by Cash-Constrained Start-Ups: the Startup's Optimal Launch and Development Strategy Below the Established Firm's Deferral ThresholdResearch Paper

Firms that develop technology in generations face a recurring choice: sell the product they already have, or hold it back while the next generation is developed. Selling it earns revenue now, but once the advanced product arrives, the earlier product cannibalizes part of its market. An established firm makes this choice by weighing development risk against…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: Shuze Chen

Scheduling Parallel Machines On-Line: Removing advance knowledge of release datesResearch Paper

A scheduler in a computing system may know how to allocate a fixed collection of jobs efficiently while having no reliable forecast of future arrivals. A guarantee for jobs available at the outset does not immediately answer whether decisions remain effective when new work appears during execution. Unknown release dates capture this distinction: a job…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk XII: The Value-of-Information Process Is a SupermartingaleTextbook

Multi-stage stochastic optimization models a decision maker who acts at times 0,1,…,T−10,1,\dots,T-10,1,…,T−1 while a random scenario unfolds, and who may use at each time only the information revealed so far. This nonanticipativity constraint is what separates a genuine multi-stage problem from a collection of deterministic ones. A standard way of measuring its cost, the…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk IX: Dual Representation of the Nested Average Value-at-RiskTextbook

Risk that unfolds over several periods is measured in two common ways. One adds up one-period measurements of each payment, each made with the information available one step earlier. The other composes one-period conditional measurements backwards in time, the way dynamic programming evaluates a policy. The second way is the one used in multistage…

6 thms2 active usersReviewed
🏆Completed
EconomicsLinear algebraOperations Research+2·Captain: Shuze Chen

Modeling, Measuring and Managing Risk XI: The Mean-Variance Efficient Portfolio in Closed FormTextbook

An investor who splits a budget across MMM risky assets faces a trade-off between expected return and risk. Markowitz proposed measuring risk by the variance of the portfolio return and selecting, for each required expected return, the portfolio of least variance (Markowitz 1952). Tobin added a risk-free asset (Tobin 1958), and Sharpe, Lintner and Mossin…

4 thms2 active usersReviewed
PreviousPage 97 of 143Next

Top contributors

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