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.

4812 missions

Missions

426–450 of 4812
Open1285Completed3527All4812
🏆Completed
Operations ResearchOptimizationRevenue Management and Pricing·Captain: iris

Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models: Under Symmetric MNL Demand the Optimal Markup Is Uniform and Falls with Risk Aversion, Reaching Zero Past a ThresholdResearch Paper

Pricing under discrete choice models is a core tool of revenue management: a firm sets prices for a line of substitute products, and customers choose one product or nothing according to a probabilistic choice rule. Almost all of this literature assumes a risk-neutral firm that maximizes expected profit. Under the multinomial logit (MNL) model with a common…

13 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability+1·Captain: iris

Cloud Cost Optimization: Model, Bounds, and Asymptotics: The Newsvendor Policy π* Has Optimality Gap at Most √θ Times the Bound (14), So It Is Asymptotically Optimal as Demand Scales by θResearch Paper

Cloud providers sell computing capacity in two ways: reserved resources, paid for every period whether used or not, and on-demand resources, rented one period at a time at a higher price. A firm that runs a stream of computing jobs with deadlines must decide how much capacity to reserve once, how much to rent each period, and which job runs on which…

48 thms4 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability+2·Captain: iris

Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits: SAMBA Converges to the Optimal Arm Almost Surely with Regret at Most NαΔlog⁡T+Q\frac{N}{\alpha\Delta}\log T + QαΔN​logT+QResearch Paper

Policy-gradient methods adjust the probabilities with which a learner picks actions by following an estimated gradient of its expected reward. They underlie much of modern reinforcement learning (Williams 1992; Sutton–Barto 2018), yet regret guarantees for them are scarce even in the simplest setting, the stochastic multi-armed bandit, where the benchmark…

24 thms4 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability+1·Captain: iris

Risk Averse Stochastic Programming: Time Consistency and Optimal Stopping: The Nested-Risk Snell Envelope Is the Optimal Stopping Value, Attained by the First Time It Meets the RewardResearch Paper

Optimal stopping asks when to stop a reward process Z0,…,ZTZ_0,\dots,Z_TZ0​,…,ZT​ so as to make the stopped reward ZτZ_\tauZτ​ as large as possible. In its classical form the criterion is the expectation E[Zτ]\mathbb E[Z_\tau]E[Zτ​], and the solution is the Snell envelope: the value process obtained by comparing, at each date, the reward for stopping now with the conditional expectation…

22 thms4 active usersReviewed
Machine LearningOperations ResearchReinforcement Learning+1·Captain: iris

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis: Synchronous Q-Learning Is ε-Accurate in ℓ∞ with Probability 1−δ Once T ≥ c₃·log⁴T·log(|S||A|T/δ)/((1−γ)⁴ε²)Research Paper

Q-learning (Watkins and Dayan, 1992) is the textbook model-free reinforcement learning method: it estimates the optimal action-value function of a Markov decision process directly from samples, without estimating the transition kernel. Understanding how many samples it needs is the basic statistical question about the algorithm, and it decides whether plain…

32 thms4 active usersReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: iris

The Pareto Frontier of Inefficiency in Mechanism Design: Second-Price Mechanisms with Relative Reserves Exactly Attain the PoA/PoS Frontier of Anonymous Task-Independent SchedulingResearch Paper

Scheduling tasks on unrelated machines is the problem with which algorithmic mechanism design began (Nisan and Ronen, 1999). The machines are selfish: each one knows its own processing times and may misreport them, and a mechanism must allocate the tasks and pay the machines so that the makespan stays low. For two decades the field studied truthful…

36 thms4 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: iris

Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints: The Scaled Stationary Job Counts Collapse onto One Exponential Variable Times the Critical Arrival ProportionsResearch Paper

Parallel-server systems in data centres cannot send every job everywhere: data locality and license restrictions tie each job to a subset of the servers. Redundancy scheduling copes with this by replicating a job to all of its compatible servers. Under cancel-on-completion (c.o.c.) the other replicas are discarded when the first one finishes; under cancel-on…

54 thms4 active usersReviewed
Algorithmic Game TheoryComplexity TheoryMechanism Design+1·Captain: iris

Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions: Computing a Welfare-Maximizing Core Outcome Is Σ₂ᵖ-HardResearch Paper

Many markets trade packages of indivisible goods between several buyers and several sellers at once: airport time slots, spectrum licences, transport capacity, emission permits. Such a market is a combinatorial exchange. Its operator chooses who trades which package and at which prices, and wants the outcome to be stable: no group of participants should be…

16 thms4 active usersReviewed
Convex OptimizationOperations ResearchProbability·Captain: iris

Stochastic Localization Methods for Convex Discrete Optimization via Simulation: Shrinking Uniform Sampling Returns an (ε, δ)-PGS Solution at Cost O(ε⁻² log(N/δ) + N)Research Paper

Many operational decisions are a single integer: the number of trucks to recruit for a region, the number of staff for an event, the number of servers in a queueing system. When the performance of each choice can only be estimated by simulation, finding a good choice is a problem of optimization via simulation: each evaluation of a candidate returns a noisy…

44 thms4 active usersReviewed
Linear OptimizationOperations ResearchOptimization+1·Captain: iris

Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets: re-solving a dynamic primal loses O(√θ) revenue against the hindsight optimum, and O(1) under no early endingResearch Paper

Railway operators in China sell tickets for high-speed trains on routes with many intermediate stops, at fares fixed by regulation. A ticket from stop iii to stop j+1j+1j+1 uses legs i,…,ji,\dots,ji,…,j, and at the moment of purchase the passenger must be given one seat for the whole trip. Seats cannot be swapped later. This assign-to-seat restriction is absent from…

19 thms4 active usersReviewed
Bandit AlgorithmsMachine LearningStatistics·Captain: iris

Distributionally Robust Batch Contextual Bandits: The Learned KL-Robust Policy Has Robust Regret O((κ(n)(Π)+log⁡(2/ε))/(bηn))O((\kappa^{(n)}(\Pi)+\sqrt{\log(2/\varepsilon)})/(b\eta\sqrt{n}))O((κ(n)(Π)+log(2/ε)​)/(bηn​)) with Probability 1−ε1-\varepsilon1−εResearch Paper

In offline policy learning a decision maker holds logged data from a contextual bandit — contexts, the actions a logging policy took, and the rewards those actions earned — and must choose a policy from a class Π\PiΠ without further experimentation. Personalized medicine, online advertising and public-policy targeting all fit this template. The standard…

24 thms4 active usersReviewed
Linear OptimizationOperations ResearchOptimization+1·Captain: iris

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds: the sampled dual LP optimum converges to the stochastic-program optimum with E‖p_n − p‖² ≤ C·m log m·log log n / nResearch Paper

Online linear programming (OLP) models sequential resource allocation: orders (rj,aj)(r_j,a_j)(rj​,aj​) arrive one at a time, each must be accepted or rejected on arrival, and accepted orders consume the capacities bbb of a linear program. It covers network revenue management, online auctions, matching and the multi-secretary problem. Almost every OLP algorithm uses the same…

15 thms4 active usersReviewed
Algorithmic Game TheoryEconomicsOperations Research·Captain: iris

Constrained Trading Networks: Under an Integral Polymatroid Constraint on Trades, the Efficient-Allocation Relaxation with Separable M♮-Concave/Linear Valuations Has an Integral OptimumResearch Paper

In a trading network agents sit at the vertices of a directed multigraph and every arc is a bilateral trade: its source sells, its sink buys, and an outcome records how many copies of each trade are executed. When valuations satisfy a gross-substitutes condition (M♯^\sharp♯-concavity), competitive equilibria exist and efficient outcomes can be computed by a…

26 thms4 active usersReviewed
Algorithmic Game TheoryControl TheoryProbability+2·Captain: iris

Exploration Noise for Learning Linear-Quadratic Mean Field Games: With Common Noise, the Tilted Geometric Fictitious Play Converges to the Equilibrium at Rate ϖ−nexp⁡(C/ε2)\varpi^{-n}\exp(C/\varepsilon^2)ϖ−nexp(C/ε2)Research Paper

A mean field game (MFG) describes a continuum of identical players, each controlling its own state and paying a cost that depends on the statistical distribution of the population. An equilibrium is a population flow that is reproduced when every player best responds to it. Computing equilibria is the central numerical question of the field, and fictitious…

16 thms4 active usersReviewed
Complexity TheoryOperations ResearchOptimization·Captain: iris

Serial batching to minimize the weighted number of tardy jobs: W[1]-hardness for #d + #p and for #p + #r, with XP algorithms for #d + #p + #w and for #p + #r + #wResearch Paper

In manufacturing, items move between facilities in boxes, pallets or carts, and everything placed in one container leaves together. Serial batch scheduling models this: a single machine processes jobs in batches, each batch costs a fixed setup time plus the processing times of its jobs, and all jobs of a batch complete together. Minimizing the weighted…

30 thms4 active usersReviewed
Algorithmic Game TheoryMachine LearningProbability+1·Captain: iris

Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium: Offline OMNI-VI Has Total Duality Gap O(√(d³H³Tι²)) with Probability 1−pResearch Paper

Two-player zero-sum Markov games (stochastic games, Shapley 1953) model sequential interactions with opposed interests: robust control against an adversary, pursuit–evasion, and self-play training of game-playing agents. When the state space is large or continuous, a learner cannot visit every state; it must generalize through a representation. The question…

31 thms4 active usersReviewed
Markov ChainOperations ResearchProbability+1·Captain: iris

Stability of Parallel Server Systems: if jobs that find all servers busy go to the second-shortest queue with probability p, the system is unstable for every ρ ≥ V_cr(p)Research Paper

A parallel-server system has sss identical servers, each with its own queue, and a dispatcher that sends every arriving job to one of them. With Poisson arrivals of rate λ\lambdaλ and exponential services of rate μ\muμ, the traffic intensity is ρ=λ/(sμ)\rho=\lambda/(s\mu)ρ=λ/(sμ), and ρ<1\rho<1ρ<1 is necessary for any dispatcher to keep the queues finite. For the classical policies —…

14 thms4 active usersReviewed
CombinatoricsConvex OptimizationOperations Research+1·Captain: iris

Geometric Rescaling Algorithms for Submodular Function Minimization: Rescaling-SFM finds a minimizer of an integer-valued submodular function in O((n4⋅EO+n5)log⁡(nL))O((n^4\cdot\mathrm{EO}+n^5)\log(nL))O((n4⋅EO+n5)log(nL)) timeResearch Paper

A set function f:2V→Rf : 2^V \to \mathbb{R}f:2V→R on a finite set VVV is submodular if f(X)+f(Y)≥f(X∪Y)+f(X∩Y)f(X) + f(Y) \ge f(X \cup Y) + f(X \cap Y)f(X)+f(Y)≥f(X∪Y)+f(X∩Y) for all X,Y⊆VX, Y \subseteq VX,Y⊆V. Submodular function minimization (SFM) asks for a set minimizing fff when fff is available only through a value oracle of cost EO\mathrm{EO}EO. Minimum cut, matroid intersection and several scheduling and image-segmentation…

55 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: iris

Negotiations in Competing Supply Chains: The Kalai-Smorodinsky Bargaining Solution: Simultaneous KS Wholesale Prices Equal the Nash Bargaining Prices at Retailer Power 0.6Research Paper

Wholesale prices between a supplier and a retailer are usually negotiated, not posted. Models of such negotiations almost always use the Nash bargaining solution (Nash, 1950), often in the generalized form with a bargaining power θ\thetaθ (Binmore, Rubinstein, Wolinsky, 1986). The Nash solution satisfies independence of irrelevant alternatives, which is the…

13 thms4 active usersReviewed
Complexity TheoryOperations ResearchOptimization·Captain: iris

The Complexity of Recognizing Facets for the Knapsack Polytope: Deciding Whether an Integer Inequality Defines a Facet of a Knapsack Polytope Is Dᵖ-CompleteResearch Paper

Integer programs are solved in practice by adding valid inequalities to a linear relaxation, and the strongest valid inequalities are the facet-defining ones. Knapsack polytopes are a central case: every row of a binary integer program defines one, and cuts derived from individual knapsack rows (lifted cover inequalities and their relatives) are part of…

30 thms4 active usersReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: iris

Shapley–Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange: With Strict Preferences the Unique Strong Core Allocation Respects ImprovementResearch Paper

In a kidney exchange programme a patient arrives with a willing but incompatible donor, and patients swap donors along cycles so that each patient receives a compatible kidney. The standard model of such swaps is the housing market of Shapley and Scarf (Shapley–Scarf 1974): each agent owns one indivisible object and the agents reallocate the objects among…

14 thms4 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: iris

Pandora’s Problem with Combinatorial Cost: Under a Submodular Cost Function Some Fixed-Order Threshold Strategy Is OptimalResearch Paper

Pandora's problem is the basic model of costly sequential search: a decision maker faces nnn closed boxes with independent random prizes, may open them one at a time at a cost, and keeps the best prize found. It models job and house search, the selection of research projects, and the sampling stages of auctions and pricing mechanisms. Weitzman (Weitzman 1979)…

19 thms4 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: iris

Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem: A Threshold With Expected Utilization γₖ Earns at Least γₖ = 1 − e⁻ᵏkᵏ/k! Times the Prophet's ValueResearch Paper

In the prophet secretary problem, a decision-maker holds kkk identical items and meets nnn applicants one at a time. Each applicant's value is drawn independently from a known distribution, and the applicants arrive in a uniformly random order. On seeing a value, the decision-maker must immediately accept the applicant or reject them for good. The model…

33 thms4 active usersReviewed
Convex OptimizationMachine LearningOperations Research+1·Captain: iris

Stochastic Optimization with Decision-Dependent Distributions: Proximal SGD with Bias ≤ B‖x − x̄‖ Converges Linearly to an η-Sized Noise Floor (ρ < 1 for Distance, ρ < 1/2 for Value)Research Paper

In many learning and decision problems the data distribution reacts to the decision. A credit-scoring rule changes how applicants present themselves; a price changes demand; a deployed classifier changes the population it is later retrained on. Performative prediction (Perdomo, Zrnic, Mendler-Dünner, Hardt, ICML 2020) models this by a map …

15 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatoricsMechanism Design·Captain: iris

Fair Shares: Feasibility, Domination, and Incentives: For Any Valuation Class Containing All Additive Valuations, No Feasible Share Dominates Every Self-Maximizing Feasible ShareResearch Paper

When indivisible goods are divided among nnn agents without money, a standard way to say what each agent deserves is a share: a number s(v,n)s(v,n)s(v,n) computed from the agent's own valuation vvv alone, with the promise that she receives a bundle worth at least that much. The best-known share is the maximin share (MMS) of Budish (2011): the value an agent could guarantee…

23 thms4 active usersReviewed
PreviousPage 18 of 193Next

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