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

26–50 of 1285
Open1285Completed3527All4812
Algorithmic Game TheoryMachine LearningOperations Research+1·Captain: iris

On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning: Mean-Based Monotonic Play Cannot Converge Almost Surely to the Nash Equilibrium of a Competitive 2×2 GameResearch Paper

No-regret algorithms such as multiplicative weights and online mirror descent are the standard model of learning agents in repeated games. A classical fact is that when two such agents play a zero-sum game, the time-average of their mixed strategies converges to a Nash equilibrium (Freund and Schapire, 1999), and in general games the average play converges…

18 thms5 active usersReviewed
Algorithmic Game TheoryBandit AlgorithmsConvex Optimization·Captain: iris

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback: Barrier Bandit Mirror Descent Reaches the Nash Equilibrium at Last-Iterate Rate O~(nT−1/2)\tilde O(nT^{-1/2})O~(nT−1/2)Research Paper

In many operations problems several decision makers act repeatedly on a shared system and see only the payoff they receive: firms setting quantities in a Cournot market observe the market price, sellers in a pricing game observe their revenue, bidders in a Kelly auction observe their allocation. None of them knows the reward functions or their gradients. Ban…

18 thms5 active usersReviewed
Machine LearningOperations ResearchProbability+1·Captain: iris

Smooth Nested Simulation: Bridging Cubic and Square Root Convergence Rates in High Dimensions: KRR Nested Expectation Error Is O_P(Γ^{-1/2}) if ν ≥ d/2 and O_P(Γ^{-(2ν+d)/(2ν+3d)}) if ν < d/2Research Paper

Nested simulation estimates a quantity of the form θ=T(E[Y∣X])\theta=\mathcal T(\mathbb E[Y\mid X])θ=T(E[Y∣X]): an outer random scenario XXX (for example the state of a market at a risk horizon) and, for each scenario, an inner random quantity YYY (for example the discounted payoff of a portfolio) whose conditional mean f(x)=E[Y∣X=x]f(\mathbf x)=\mathbb E[Y\mid X=\mathbf x]f(x)=E[Y∣X=x] has no closed form.…

27 thms5 active usersReviewed
Algorithmic Game TheoryComputational ComplexityEconomics+1·Captain: iris

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability: Finding an Envy-Free and Pareto-Optimal Lottery Is PPAD-HardResearch Paper

Allocating indivisible goods without money (school seats, dormitory rooms, course slots, organ-transplant priority) is a central problem of market design. When agents report cardinal utilities rather than rankings, the classical answer is the mechanism of Hylland and Zeckhauser (1979): give every agent one unit of fake money, find market-clearing prices for…

31 thms5 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: iris

Minimal-Access Rights in School Choice and the Deferred Acceptance Mechanism: deferred acceptance is the only mechanism that is minimal-access stable, strategy-proof and minimal-access monotonicResearch Paper

In many school choice systems a school's priority over applicants has two layers: an absolute priority (an exam score, a grade point average, a lottery number) and a set of minimal-access rights (a sibling at the school, living in its walk zone). The standard practice is to merge the two into adjusted priorities: at each school, every student holding a…

21 thms5 active usersReviewed
Bandit AlgorithmsMachine LearningReinforcement Learning·Captain: iris

Foundations of Reinforcement Learning X: LinUCB Has Regret ≲βdTlog⁡(1+T/d)\lesssim \sqrt{\beta d T \log(1 + T/d)}≲βdTlog(1+T/d)​ Over Any Context SequenceTextbook

Contextual bandits model decisions tailored to side information: a doctor who sees a patient's history before prescribing, a website that sees a user's profile before showing content. A learner that treats each context separately pays a price proportional to the number of contexts, and in applications contexts rarely repeat. Linear contextual bandits escape…

22 thms5 active usersReviewed
Linear Optimization·Captain: Shuze Chen

The ddd-step conjecture for polyhedra of dimension d<6d<6d<6: The bounded five-step diameter equalityResearch Paper

Linear programs describe feasible regions by linear inequalities. An algorithm that moves between neighboring vertices follows edges of such a region, so the number of edges needed to join two vertices gives a geometric constraint on what edge-following algorithms can accomplish. This question concerns the graph of the feasible region, independently of an…

19 thms5 active usersReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?: A fully polynomial approximation scheme for cardinality-constrained assortmentsResearch Paper

Which products should a retailer offer when customers can choose at most one product or leave without buying? The answer depends on how products compete for a customer's attention. Offering another product can change the demand for every product already available. A choice model therefore determines both the revenue objective and the mathematical difficulty…

20 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization+1·Captain: Shuze Chen

Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection: Offering all products first earns 87.8 percent of optimumResearch Paper

A retailer that recommends products over several screens faces two decisions: which products to show at each stage, and what prices to charge. Customers may buy before seeing later offers, or leave without viewing the complete sequence. A revenue comparison must therefore account for the order of offers and the customer's willingness to continue browsing. Ga…

18 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization+1·Captain: Shuze Chen

Robust Optimization IX: Safe Matrix Chance ConstraintsTextbook

A semidefinite constraint asks whether a symmetric matrix is positive semidefinite: every vector must have a nonnegative quadratic form under that matrix. In optimization, its entries can depend on a decision and on uncertain inputs. Requiring the constraint for every possible input can be restrictive, especially when rare inputs have very large magnitude.…

8 thms5 active usersReviewed
Bandit AlgorithmsOperations ResearchOptimization+1·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices VII: Freezing Rules, Forwards Induction and the Near-Optimality of ε-Index* PoliciesTextbook

A multi-armed bandit in the sense of Gittins is a sequential allocation problem: several independent Markov reward processes compete for a single resource, at each decision time exactly one of them is operated, and the goal is to maximize the expected total discounted reward. The Gittins index theorem says that it is optimal to operate, at every decision…

11 thms5 active usersReviewed
Algorithmic Game TheoryControl TheoryMarkov Chain+1·Captain: mikedeng1

Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time 1: Weak and Strong Equilibria Exist When the Admissible Generator Rows Form Convex Compact SetsResearch Paper

An agent whose preferences change over time cannot simply optimize. Under non-exponential discounting, for instance hyperbolic or pseudo-exponential discount functions, a plan that is optimal today stops being optimal tomorrow, and a later self deviates from it. Strotz (1955) proposed that a sophisticated agent treat future selves as players in a game and…

17 thms5 active usersReviewed
Control TheoryDynamic ProgrammingMarkov Chain+1·Captain: mikedeng1

Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time 3: Discrete-Time Equilibria Exist on an Infinite Horizon for Closed Convex Admissible Transition RowsResearch Paper

In many dynamic decision problems the criterion an agent uses today is not the one it will use tomorrow. The standard example is non-exponential discounting: if a payoff received ttt periods from now is weighted by δ(t)\delta(t)δ(t) and δ\deltaδ is not geometric, then the plan that is optimal from today's point of view will be abandoned by the agent's future selves.…

11 thms5 active usersReviewed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization: NASA with Stepsizes 1/√N Drives the Expected Stationarity Measure E[V(x_R, z_R)] Below C/(√N − 1)Research Paper

Many learning and risk-averse decision problems minimize a function of an expectation that is itself passed through another function: F(x)=f(g(x))F(x)=f(g(x))F(x)=f(g(x)) with g(x)=E[G(x,ξ)]g(x)=\mathbb E[G(x,\xi)]g(x)=E[G(x,ξ)]. Examples are mean–deviation risk measures, stochastic variational inequalities rewritten as minimization, and policy evaluation in reinforcement learning. Only noisy samples of ggg,…

15 thms5 active usersReviewed
Control TheoryDynamical SystemsGraph Theory+1·Captain: mikedeng1

Synchronization via Pinning Control on General Complex Networks I: A Kronecker LMI Weighted by the Positive Left Null Vector of G Globally Synchronizes a Pinned Strongly Connected NetworkResearch Paper

Many engineered and natural systems are networks of identical dynamical units coupled through a directed interaction graph: arrays of oscillators, power grids, sensor and multi-agent networks, gene regulatory circuits. A basic control question for such a network is how to force every unit onto a prescribed reference trajectory (an equilibrium, a periodic…

10 thms5 active users
Bandit AlgorithmsOperations ResearchStatistics·Captain: mikedeng1

Dynamic Assortment Personalization in High Dimensions 1: The Nuclear-Norm Explore-Then-Exploit Policy Has Regret at Most ((Cr(m+n)+3) log T + 1)ωResearch Paper

An online retailer that serves many kinds of customers must decide, for each arriving customer, which handful of products to display. Showing too many items is impossible (screen space, shelf space), and which items sell depends on who is looking. The retailer does not know the customers' preferences in advance and learns them only from the choices…

22 thms5 active usersReviewed
Operations ResearchOptimal TransportOptimization+1·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 7: For c = |y − x| and Continuous µ the Optimizer Is Unique, Keeps µ ∧ ν in Place, Splits the Rest in TwoResearch Paper

A martingale transport plan between two laws μ\muμ and ν\nuν on R\mathbb RR is a joint law of a pair (X,Y)(X,Y)(X,Y) with X∼μX\sim\muX∼μ, Y∼νY\sim\nuY∼ν and E[Y∣X]=XE[Y\mid X]=XE[Y∣X]=X. Minimizing or maximizing E[c(X,Y)]E[c(X,Y)]E[c(X,Y)] over such plans gives the model-independent price bounds of an option with payoff c(X,Y)c(X,Y)c(X,Y) when the market quotes vanilla options at two maturities, and so fixes the marginal laws μ\muμ…

19 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming II: A Long Step of the Conic Karmarkar Method Lowers the Potential by at Least (‖p‖²/|p|²)(1 − ln 2) ≥ 1 − ln 2Research Paper

Karmarkar's projective method (1984) was the first interior-point algorithm for linear programming with a polynomial bound that was also fast in practice. Its analysis rests on a potential function that combines the logarithm of the objective gap with a logarithmic barrier: if every iteration lowers the potential by a fixed constant, then the gap shrinks…

15 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming I: A Joint-Scaling Primal-Dual Long Step Lowers the Potential (ν + ρ) ln⟨s, x⟩ + F(x) + F∗(s) by at Least √3/2 − ln(1 + √3/2)Research Paper

Interior-point methods solve linear, second-order cone and semidefinite programs in polynomial time, and they are the engine of most conic optimization software. The general theory of Nesterov and Nemirovskii (1994) covers any convex cone with a self-concordant barrier, but its methods are essentially primal and short-step: their analysis controls the…

22 thms5 active usersReviewed
AlgebraCombinatoricsInformation Theory+1·Captain: mikedeng1

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2: The Improved Juels–Sudan Sketch Is an Average-Case Secure Sketch for s-Element Sets with Entropy Loss t log nResearch Paper

Many security-relevant inputs are noisy and do not repeat exactly: fingerprint minutiae, iris codes, lists of personal preferences, the set of features extracted from a document. A cryptographic key derived from such an input must be reproducible from a later, slightly different reading, without storing the input itself. Dodis, Ostrovsky, Reyzin and Smith (S…

11 thms5 active users
AnalysisOperations ResearchProbability+1·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 3: Rate of Approach — t^κP(R > t) Equals C₊ Minus a Contour Integral Plus O(t^{−β/2})Research Paper

Random equations of the form R=LΨ(R)R \overset{\mathcal L}{=} \Psi(R)R=LΨ(R), with Ψ\PsiΨ a random function independent of RRR, describe the stationary laws of many stochastic recursions: perpetuities in insurance and finance, the stationary law of ARCH-type volatility models, random difference equations R=Q+MRR = Q + MRR=Q+MR, and the stationary workload of certain queueing and storage…

17 thms5 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 2: Kesten's Theorem for R = Q + MR — Unique Stationary Law, Power Tails with Explicit C±, and C₊ + C₋ > 0 iff Q ≢ (1 − M)cResearch Paper

The random difference equation

16 thms5 active usersReviewed
Complexity TheoryInformation TheoryProbability+1·Captain: mikedeng1

A Pseudorandom Generator from Any One-Way Function: One-Way Functions Exist If and Only If Pseudorandom Generators ExistResearch Paper

Cryptographic protocols use random looking strings that can be reproduced from a shorter private seed. A pseudorandom generator provides those strings if no efficient observer can tell them from uniformly sampled bits. A one-way function provides a different kind of asymmetry: anyone can evaluate it efficiently, but no efficient algorithm can usually…

21 thms5 active usersReviewed
CombinatoricsDiscrete GeometryLinear Optimization·Captain: mikedeng1

The d-Step Conjecture for Polyhedra of Dimension d < 6 1: The Bounded 5-Step Conjecture Holds, Every 5-Polytope with 10 Facets Has Diameter at Most 5, i.e. Δb(5, 10) = 5Research Paper

The simplex method and every other edge-following linear programming algorithm moves from vertex to vertex of the feasible region along its edges. The number of steps such an algorithm needs in the worst case is at least the combinatorial diameter of the feasible polyhedron: the largest distance, counted in edges, between two of its vertices. Klee and…

15 thms5 active usersReviewed
Bandit AlgorithmsDynamic ProgrammingOperations Research+1·Captain: mikedeng1

Bandit Processes and Dynamic Allocation Indices: A Policy Is Optimal If and Only If It Almost Surely Continues a Bandit Process of Maximal Dynamic Allocation IndexResearch Paper

The multi-armed bandit problem asks how to share effort sequentially among several independent projects, each of which evolves only while it is worked on. It models the scheduling of jobs on a single machine, the order in which to explore candidate sites, sequential clinical trials and the allocation of research effort among competing projects. Before 1972…

8 thms5 active usersReviewed
PreviousPage 2 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