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
EconomicsProbability·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
Dynamic Programming·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
Optimization·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
OptimizationProbabilityStochastic Systems·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
OptimizationProbabilityStochastic Systems·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 algebraOptimization+1·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
🏆Completed
OptimizationProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk VI: Choquet Representation of Distortion FunctionalsTextbook

A distortion functional values an uncertain profit YYY by integrating its quantiles against a reweighting of the probability scale: small (bad) quantiles receive more weight, large ones less. The construction appears in actuarial pricing (the distortion premium principles of Denneberg and Wang), in decision theory (Yaari's dual theory of choice), and in…

9 thms2 active usersReviewed
🏆Completed
Functional AnalysisOptimizationProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk IV: Kusuoka Representations of Version-Independent Acceptability FunctionalsTextbook

Risk measures used in portfolio optimization, insurance pricing and regulation are almost always law invariant: they assign a number to a random profit YYY that depends only on its distribution, not on the scenario in which each outcome occurs. Kusuoka (Kusuoka 2001) showed that on a non-atomic space every law-invariant coherent risk measure is the worst…

10 thms2 active usersReviewed
🏆Completed
Control TheoryProbabilityStochastic Systems·Captain: Shuze Chen

Stochastic Networks XV: Positive Recurrence under MaxWeight SchedulingTextbook

A switch or wireless network can have several queues ready for service while its hardware permits only certain combinations to be served together. A scheduler must choose a feasible combination repeatedly as new packets arrive. The question is whether this local sequence of decisions keeps the queue process stable whenever the arrival rates fit within the…

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationProbability·Captain: Shuze Chen

Stochastic Networks XIII: The Capacity Region of Distributed Random AccessTextbook

Stations sharing a communication channel must decide when to transmit. If nearby stations transmit together, their signals may interfere; if they all wait, capacity is wasted. A central scheduler can coordinate activity, but distributed access assigns decisions to individual stations. The mathematical question is whether simple random local decisions can…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Robust Optimization XIII: Exact Quadratic Decision Rules on EllipsoidsTextbook

An adjustable decision is a rule that responds to information revealed after an optimization problem is specified. In production planning, for example, a later quantity may depend on observed demand, while an earlier commitment must remain constant. A robust counterpart requires the resulting decisions to satisfy the constraints for every realization in a…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Robust Optimization XIV: Extreme-Scenario Reduction in Multistage InventoryTextbook

An inventory manager chooses replenishment orders before knowing all future demand. Orders made today affect both the stock available tomorrow and the cost of later decisions. A flexible commitment contract adds another consideration: deviations from previously announced orders can incur penalties. The uncertainty therefore concerns a sequence of…

2 thms2 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: Shuze Chen

Robust Optimization XI: Finite Reformulations of Worst-Case Convex LossTextbook

Regression and classification fit a parameter vector to observed data. When measurements can vary within a prescribed set, a fit judged only at the nominal observations need not control its loss on the possible data. A worst-case loss constraint requires the loss bound to hold for every admissible matrix of measurements. Such a requirement can contain…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: Shuze Chen

Robust Optimization II: Safe Robust Counterparts for Bounded Random PerturbationsTextbook

A linear constraint can fail when its coefficients vary. In an engineering or planning model, requiring it to hold for every imaginable realization may exclude useful decisions, while checking it only at an average realization may give little control over failure. A chance constraint specifies an acceptable probability of violation. Chapter 2 of Ben-Tal, El…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: Shuze Chen

Robust Optimization IV: The Bernstein Uncertainty SetTextbook

An optimization model can require a linear inequality to hold with high probability when its coefficients are random. Such a chance constraint controls the probability of violation, but its feasible set need not be convex or easy to describe. A conservative convex approximation can make the requirement usable within a larger optimization model. Chapter 4 of …

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Robust Optimization III: Global Sensitivity for Linear ConstraintsTextbook

A resource constraint can remain useful even when an exceptional disturbance makes exact satisfaction impractical. In such cases the model needs to distinguish the disturbances against which feasibility is mandatory from those for which a controlled violation is acceptable. Ordinary robust optimization specifies a set of perturbations and requires the…

1 thm2 active usersReviewed
🏆Completed
EconomicsProbability·Captain: mikedeng1

An Axiomatic Foundation for the Expected Shortfall: Monotonicity, Law Invariance, Prudence and No Reward for Concentration Characterize ES on L¹Research Paper

Banks hold capital against the risk of their trading books, and the amount is computed by a risk measure: a functional ρ\rhoρ that assigns a real number to each random loss XXX. For two decades the regulatory standard was the Value-at-Risk VaRp\mathrm{VaR}_pVaRp​, a quantile of the loss. The Fundamental Review of the Trading Book of the Basel Committee (BCBS, 2019)…

12 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Negotiating Government-to-Government Food Importing Contracts: A Nash Bargaining Framework: With Sufficiently Many Suppliers, Forward Negotiations Beat Ad Hoc Negotiations for the BuyerResearch Paper

Food importers that also produce domestically must decide whether to commit to purchases before the domestic harvest or negotiate after observing it. This choice matters when suppliers must plant before the harvest is known: a late negotiation leaves them exposed to unsold production, while an early contract commits the importer to purchases it may no…

11 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Offering Memories to Sell Goods? Pricing and Welfare Implications of Experiential Retail: A Sufficiently Low-Quality Free Experience Raises Both the Monopoly Retailer's Profit and Consumer WelfareResearch Paper

Retailers increasingly pair products with free in-store experiences: yoga classes at Lululemon, playgrounds at Toys "R" Us, cooking classes at Whole Foods. The experience is free to anyone who travels to the store, so it attracts buyers and free riders (visitors who enjoy the experience without buying) alike. The retailer earns revenue only from product…

5 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Selling Assets: Are Sellers Better Off with Strong Buyers?: Under Free Entry, a More Dominant Strong Buyer Lowers the Seller's RevenueResearch Paper

A seller who can attract a buyer with a higher valuation might expect a higher auction price. That intuition holds when the number of competing buyers is fixed. If other buyers must pay to learn their valuations and decide whether to enter, a stronger buyer can instead cause some of them to stay out. Marquez and Singh study this response in a second-price…

7 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Managerial Regret and Inventory Pricing: The Regretful Seller's Marginal Value of Inventory and Price Increase with Time-to-Go and Decrease with Remaining InventoryResearch Paper

Revenue management studies how a seller with a fixed stock and a finite selling season should price over time. The classical models assume an expected-revenue maximizer: Gallego and van Ryzin (1994) in continuous time and Bitran and Mondschein (1997) in discrete time showed that the optimal price and the marginal value of inventory rise with the time left…

11 thms2 active usersReviewed
🏆Completed
Optimal TransportProbabilityStatistics·Captain: mikedeng1

Joint Mixability and Notions of Negative Dependence: The Minimizers of the Worst-Case Quadratic Cost over Subsets of Components Are Exactly the NCD Joint Mixes with Correlation Matrix P*_nResearch Paper

A joint mix is a random vector X=(X1,…,Xn)\mathbf X=(X_1,\dots,X_n)X=(X1​,…,Xn​) whose component sum ∑i=1nXi\sum_{i=1}^n X_i∑i=1n​Xi​ is almost surely constant. For fixed marginal distributions it minimizes the variance, the stop-loss premium and the Expected Shortfall of the aggregate, which comonotonicity maximizes, and for this reason it is regarded as the canonical form of extremal negative…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear Optimization·Captain: mikedeng1

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem: Every Ultimate Feasible Basis Is a Good Augmented Spanning Tree Whose Thick Arcs Form the Unique Perfect MatchingResearch Paper

A Hamilton cycle visits every vertex of a directed graph once and returns to its start. Finding one is a standard combinatorial optimization problem, and linear programming provides a way to study it through extreme points. Kalinowski and Mohammadian examine a polytope introduced for this purpose and ask what its feasible bases look like when a discount…

9 thms2 active usersReviewed
🏆Completed
Actuarial ScienceProbability·Captain: mikedeng1

Endogenous Inverse Demand Functions: Necessary and Sufficient Conditions for a Unique Clearing Price of a Liquidated ClaimResearch Paper

When a bank or fund in distress must sell a large position, the price it receives depends on how much it sells: the market's capacity to absorb the sale is finite. Models of fire sales and systemic risk (for instance Cifuentes, Shin and Ferrucci and Amini, Filipović and Minca) encode this through an inverse demand function, the price per unit as a function…

12 thms2 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Dynamic Double Auctions: Toward First Best: With One Seller and Many Buyers, the Mechanism That Couples All Promised Utilities Earns First-Best Profit up to O(√(T log T))Research Paper

A platform that matches one seller with several buyers can trade an item whenever a buyer values it more than the seller does. That allocation maximizes the value created by trade in a single period. A platform seeking revenue also has to respect what privately informed agents are willing to report and accept. In a repeated market, it can distribute utility…

7 thms2 active usersReviewed
PreviousPage 72 of 106Next

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