Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Operations Research

3,614 missions · 2,642 completed

The discipline of applying mathematical analysis to complex decision problems in operations: allocating scarce resources, scheduling, routing, inventory, and the design of service and production systems. Drawing on mathematical programming, stochastic modeling, queueing, simulation, and game-theoretic reasoning, it seeks policies that perform provably well in systems shaped by constraints, congestion, and uncertainty.

Missions

Open972Completed2642All3614
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators: Optimal Tolls Bounded by the Marginal Tolls Are (Strong) Cap EquilibriaResearch Paper

Congestion pricing charges road users for the delay they impose on others. The classical theory, going back to Beckmann, McGuire and Winsten (1956), assumes a single benevolent authority that sets every toll: charging each link its marginal toll makes the selfish (Wardrop) traffic pattern socially optimal. Many real networks are different. Roads, bridges…

8 thms3 active usersReviewed
Algorithmic Game TheoryBandit AlgorithmsProbability·Captain: mikedeng1

Game of Thrones: Fully Distributed Learning for Multiplayer Bandits: Without Communication, the Game of Thrones Algorithm Has Expected Total Regret O(log^{1+δ} T)Research Paper

In a multiplayer multi-armed bandit, several agents repeatedly choose among the same finite set of arms, and two agents that choose the same arm collide and receive nothing. The model comes from cognitive radio and wireless networks: users share channels, a channel used by two users at once carries neither transmission, and the quality of a channel differs…

13 thms3 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryLinear Optimization+1·Captain: mikedeng1

Binary Extended Formulations and Sequential Convexification: Among All d-Hypercube Binarizations, the Logarithmic Binarization Has Minimum RankResearch Paper

Mixed-integer programs often contain general integer variables x∈{0,…,k}x \in \{0, \dots, k\}x∈{0,…,k}. A standard modelling device replaces such a variable by ddd binary variables y∈{0,1}dy \in \{0,1\}^dy∈{0,1}d linked to xxx through a polytope, a binarization. Examples are the unary encoding, the "full" encoding with one indicator per value, and the logarithmic encoding x=∑i2i−1yix = \sum_i 2^{i-1} y_ix=∑i​2i−1yi​.…

15 thms3 active usersReviewed
🏆Completed
OptimizationTheoretical Computer Science·Captain: mikedeng1

An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem: For Every ε > 0 the Cluster Dynamic Program Returns a Feasible Solution Within Factor 1 − ε of OptimalResearch Paper

The incremental knapsack problem is a multi-period extension of the binary knapsack problem. Items are inserted over a planning horizon whose capacity grows over time, and an item, once inserted, stays. Sharp (2007) and Hartline (2008) introduced it in their theses on incremental optimization. It models resource allocation in which the available budget…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOptimization+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk X: Dual Representation of Polyhedral Acceptability FunctionalsTextbook

Risk measures enter optimization models as objectives or constraints, and the models that use them most, multi-stage stochastic programs, are solved as large linear programs. A risk functional is only usable there if it can itself be written as the value of a linear program. Eichhorn and Römisch introduced polyhedral risk measures for this purpose (doi:10.11…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk VII: Dual Representation of Minimal Loss Deviation FunctionalsTextbook

A deviation functional measures how far a random profit YYY spreads around its mean: the variance, the standard deviation, the mean absolute deviation from the median, and the average value-at-risk deviation are the standard examples in portfolio selection and in risk-averse stochastic programming. Pflug and Römisch, Modeling, Measuring and Managing Risk (Worl…

6 thms3 active usersReviewed
🏆Completed
Functional AnalysisOptimizationProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk V: Dual Representation of Conditional Acceptability MappingsTextbook

A risk measure that returns a single number answers the question "how acceptable is this random profit, seen from today?". Multi-period decision problems — portfolio rebalancing, insurance reserves, stochastic programs on scenario trees — need the same question asked at every later date, given the information available then. The answer is no longer a number…

6 thms3 active usersReviewed
CombinatoricsOptimization·Captain: Shuze Chen

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties: Polynomial approximation for monotone submodular maximizationResearch Paper

Selecting a valuable subset subject to several simultaneous restrictions is a common combinatorial optimization problem. A facility may contribute less after nearby facilities have already been selected; a collection of observations may provide overlapping information. Such diminishing returns are captured by submodular objectives. Matroid constraints…

16 thms3 active usersReviewed
🏆Completed
Algorithmic Game Theory·Captain: Shuze Chen

On the Existence of Pure Nash Equilibria in Weighted Congestion Games: Characterizing universal pure equilibrium existenceResearch Paper

A system of users sharing resources may have no stable configuration: whenever the users settle on their choices, somebody may prefer to change. Weighted congestion games describe this question when different users place different demands on the resources they choose. Routing and scheduling provide examples, but the mathematical question here does not…

22 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsStochastic Systems·Captain: Shuze Chen

Food Delivery Service and Restaurant: Friend or Foe?: With Convenient Delivery, a Critical Mass of Tech-Savvy Customers Makes the Restaurant Delivery-Only and Cuts Platform Profit and WelfareResearch Paper

Food delivery platforms such as Uber Eats, DoorDash and Meituan let a restaurant serve customers who never enter it, but they also charge those customers a delivery fee and share the restaurant's kitchen with its walk-in trade. Whether the platform helps or hurts the restaurant is a question restaurant owners, platforms and regulators all ask. Chen, Hu and…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Robust Optimization I: Conic Representations of Robust Linear ConstraintsTextbook

A production or allocation decision can satisfy a linear constraint for nominal data and violate it when those data change. Robust optimization asks for a decision that satisfies the constraint for every realization in a prescribed uncertainty set. The uncertainty set is part of the model: the requirement does not attach probabilities to its elements, and…

7 thms3 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Managing Capital Market Frictions via Cost-Reduction Investments: A Positive Friction Effect Makes Cost-Reduction Investment More Beneficial Under Capital Market Frictions than in Their AbsenceResearch Paper

A firm that can lower its unit production cost must usually spend money before it sells anything. That payment improves the margin on future sales but leaves less cash to fund production. If the firm borrows the shortfall, the investment can therefore change both its operating return and the cost of financing. Tanrisever, Joglekar, Erzurumlu and Lévesque…

9 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsProbability·Captain: mikedeng1

A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents: The Gaussian Gittins Index Equals the Posterior γ-Quantile μ + Φ⁻¹(γ)σ up to o(1) as γ → 1Research Paper

A Gittins index assigns a number to an uncertain arm in a discounted bandit problem. The index converts a sequential choice, where an agent may keep gathering information or retire, into a tax threshold for playing the arm. Computing it generally requires an optimal stopping calculation. A Bayesian upper confidence bound, by comparison, is a quantile of the…

13 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryGraph Theory·Captain: mikedeng1

Computation of Dynamic Equilibria in Series-Parallel Networks: The Thin-Flow Label Function of a Series-Parallel Network Has at Most 2|A′| − |A*| − |V| + 1 BreakpointsResearch Paper

In the fluid queuing model (Vickrey's model) of flows over time, a continuum of infinitesimal particles travels from a source sss to a sink ttt through a network whose arcs have capacities and transit times. Each particle picks a route that minimizes its own arrival time, and a dynamic equilibrium (a Nash flow over time) is a flow in which no particle can…

17 thms3 active usersReviewed
🏆Completed
EconomicsStochastic Systems·Captain: mikedeng1

Follow the Crowd with Uncertain Service Capacity: A Customer Who Infers Capacity from the Queue Length Follows the Crowd if and only if the Reward-Cost Ratio Lies in an Inference IntervalResearch Paper

Whether a customer joins a queue depends on how long she expects to wait. In the classical observable-queue model of Naor (1969), the service rate is known, and a longer queue only means a longer wait: customers avoid the crowd (ATC), so the more willing others are to join, the less willing the individual is. Many services do not publish their capacity.…

10 thms3 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Invite Your Friend and You’ll Move Up in Line: Optimal Design of Referral Priority Programs: A Unique Cutoff Base Market Size Separates Partial Priority, Full Priority and Strategic DelayResearch Paper

Firms launching a new product often open a sign-up waitlist before they can serve everyone, and many of them reward customers who invite friends with a better place in line. Robinhood (commission-free trading) and x.ai (AI email scheduling) ran such referral priority programs, the first with full priority for referrers and the second with a partial jump in…

10 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryInformation TheoryProbability·Captain: mikedeng1

Simulation of a Random Variable and its Application to Game Theory: With a Leaked Randomness Source, Alice Can Secure J_cav(H(X|Y)) in the n-Stage Repeated Game up to the Error Term (10)Research Paper

A mixed strategy assumes a player can draw from any distribution. A real player may only have a limited or imperfect source of randomness, and an opponent may observe part of it. Repeated games with bounded randomness ask how much a player can guarantee in that situation. Gossner and Vieille (2002, Games Econ. Behav. 41(2), 206–226) studied a repeated…

16 thms3 active usersReviewed
Economics·Captain: mikedeng1

Curtailing Bank Loan and Loan Insurance Under Risk Regulations in Supply Chain Finance: In the Insurance-Cooperation Region a Lower Initial Loan Limit and a Higher Fixed Bank Fee Benefit the SupplierResearch Paper

Small retailers often cannot pay for their orders out of their own capital and borrow from banks to do so. Banks in turn are regulated: risk-control rules such as value-at-risk caps limit how much they may lend against an uncertain revenue, and they charge fixed fees to process a loan. Loan insurance, offered by insurers or guaranteed by governments,…

14 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Implicit Incentives and Delegation in Teams: Delegating the Production Method Can Be Strictly Cheaper than Centralisation in a Collusion-Proof EquilibriumResearch Paper

A principal who cannot observe workers' effort must use payments tied to an observable result. In a team, each worker's effort affects the same result, so an individual bonus must support both workers' incentives. The principal may also choose who controls the production method. Giving that choice to a worker changes the actions the workers can take after a…

11 thms3 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Too Much Information: When Does Additional Testing Benefit Schools? A Free Interim Assessment Helps a School Starting Behind Only in Two Budget Regions, and Never Without Baseline ProficiencyResearch Paper

School districts in the United States are held to end-of-year proficiency targets, and many pay teachers a school-level merit-based incentive when the school is proficient at the year's standardized test. Alongside such pay schemes, districts buy interim assessments: mid-year tests that reveal where a school stands, at a reported cost of 15–15–15–20 or more per…

17 thms3 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Stationary Waiting Time in Parallel Queues with Synchronization: For Jobs of Fixed Size, the Waiting Time Converges with All Moments to the Endogenous Solution of a High-Order Lindley EquationResearch Paper

Parallel computing systems split each incoming job into pieces that are processed simultaneously on several servers. When the pieces of one job must also start together, each server keeps the order of arrival, and a job cannot begin until every server it needs has finished its earlier work, the result is a synchronized parallel queue. Waiting times in this…

12 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Penalty and Augmented Lagrangian Methods for Constrained DC Programming: Feasible Accumulation Points of the Penalty Method Are B-Stationary under the Pointwise Slater Constraint QualificationResearch Paper

A DC function is a difference of two convex functions. Programs whose objective and constraints are DC functions model sparse estimation with nonconvex penalties, affine sparsity constraints, piecewise-affine regression and several problems in signal processing and finance. Constraints of DC type make the feasible region nonconvex and nonsmooth, and the…

15 thms3 active usersReviewed
🏆Completed
EconomicsPartial Differential Equations·Captain: mikedeng1

High Discounts and Low Fundamental Surplus: An Equivalence Result for Unemployment Fluctuations: Tightness with Risk Premia Equals Tightness of an Artificial Economy Without Risk PremiaResearch Paper

In the search-and-matching model of the labor market (Diamond–Mortensen–Pissarides), firms post vacancies until the expected value of a vacancy is zero, so how many jobs exist depends on how firms value future match cashflows. Shimer (2005) showed that the standard calibration produces unemployment fluctuations far smaller than in the data. Two explanations…

7 thms3 active usersReviewed
Control TheoryDynamical Systems·Captain: mikedeng1

Optimal Control of an Epidemic through Social Distancing: Under Limited Capacity Effects Every Optimal Policy Is Single-Peaked and Infections Are Log-Concave While Measures EscalateResearch Paper

During the Covid-19 epidemic, governments had to decide not only whether to impose social distancing but how to schedule it over time: when to escalate, when to relax, and whether a relaxation might later have to be reversed. Epidemiology supplies the dynamics (the SIR model of Kermack and McKendrick, 1927), and optimal control supplies the language for…

17 thms3 active usersReviewed
🏆Completed
EconomicsMechanism Design·Captain: mikedeng1

Incomplete Contracts in Multi-period Procurement: An English Auction with a Take-It-or-Leave-It Offer Attains the Optimal Complete-Contract Buyer SurplusResearch Paper

Public and private buyers often procure the same input over several periods from a pool of competing suppliers: road maintenance, defence supply, energy, and IT services are typical cases. Between periods, conditions change. Input prices, regulations or technology shift, and so does the cost of serving the contract. A buyer who can write a complete contract…

11 thms3 active usersReviewed
PreviousPage 44 of 145Next

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