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
Algorithmic Game TheoryProbability·Captain: iris

The Competition Complexity of Dynamic Pricing: For ε > 0, m ≥ ϕ(ε)n Buyers Give (1 + ε)Aₘ(F) ≥ Mₙ(F) for Every F, Asymptotically Tight, with ϕ(ε) = Θ(log log 1/ε)Research Paper

A seller with one item faces buyers whose values are drawn i.i.d. from a distribution FFF. The welfare-optimal mechanism is an auction: it allocates to the highest bidder and achieves Mn(F)M_n(F)Mn​(F), the expected maximum of nnn values. Dynamic pricing, which offers the item to the buyers one at a time at prices that may depend on the remaining number of buyers, is…

25 thms3 active usersReviewed
CombinatoricsGraph Theory·Captain: Shuze Chen

Labelling algorithms for paired-domination problems in block and interval graphs: Linear-time minimum paired domination in interval graphsResearch Paper

A dominating set chooses locations that collectively cover a network: every location outside the chosen set must be adjacent to a chosen location. Paired domination adds a backup requirement. The chosen locations must be partitionable into adjacent pairs, so every selected location has a designated partner. Minimizing the number of selected locations…

12 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimizationProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation XII: aggregating a stagewise independent multistage program gives a lower bound that refining never decreasesTextbook

A multi-stage stochastic linear program chooses decisions over TTT stages while a random process unfolds, each decision depending only on what has been observed so far. Such problems arise in planning under uncertainty, from production and energy systems to asset-liability management. With a non-discrete distribution the unknowns are functions, and the…

48 thms3 active usersReviewed
Probability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation XIII: Boole–Bonferroni bounds on the probability of a union from two binomial momentsTextbook

The joint distribution function of a random vector is the quantity that a joint probability constraint P(ξ≤x)≥α\mathbb P(\xi\le x)\ge\alphaP(ξ≤x)≥α asks for. In dimension rrr it is an rrr-dimensional integral, and for most distributions no exact formula is available. The one- and two-dimensional marginals are usually much easier to compute, so stochastic programming algorithms…

29 thms3 active usersReviewed
🏆Completed
CombinatoricsLinear Optimization·Captain: iris

Combinatorial Optimization (Cook et al.) XI: The Subtour Bound Equals the Optimal Held–Karp Bound (corrected: loopless)Textbook

The traveling salesman problem (TSP) asks for a cheapest circuit through every node of a graph with edge costs. No polynomial-time algorithm is known, and exact codes for large instances depend on strong lower bounds to prune their search. Two lower bounds dominate the classical literature. The first is the subtour bound, the optimal value of the linear…

27 thms3 active usersReviewed
Linear OptimizationOptimization·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation X: multiple simple recourse reduces to simple recourse with a mixed distributionTextbook

In a two-stage stochastic linear program, a simple recourse constraint penalizes the gap between a first-stage quantity zzz (for example a production level tTxt^{\mathrm T}xtTx) and a random demand ξ~\tilde\xiξ~​ at constant unit costs: a surplus z>ξ~z>\tilde\xiz>ξ~​ costs β\betaβ per unit and a shortage z<ξ~z<\tilde\xiz<ξ~​ costs α\alphaα per unit. Its expected cost has a closed form in the…

21 thms3 active usersReviewed
OptimizationProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation III: separate chance constraints under a multivariate normal distribution are convex for levels at least one halfTextbook

A linear constraint ηTx≥ξ\eta^{\mathsf T}x\ge\xiηTx≥ξ whose coefficients η\etaη and right-hand side ξ\xiξ are random cannot be required to hold for every realization without becoming either infeasible or very conservative. The chance-constrained (probabilistic) approach of Charnes and Cooper asks instead that it hold with a prescribed probability α\alphaα. Whether the…

20 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation V: integrated chance constraints with a finite discrete distribution define polyhedraTextbook

A probability constraint in a stochastic linear program asks that a random linear inequality hold with high probability. It counts every violation the same, however large, and the feasible set it defines is in general not convex, as Klein Haneveld's examples show (Klein Haneveld 1986). Integrated chance constraints replace the probability of a shortfall…

17 thms3 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: iris

Fast Core Pricing for Rich Advertising Auctions: the water-filling algorithm finds an ϵ\epsilonϵ-bidder-optimal core point in O(nlog⁡(n/ϵ))O(n\log(n/\epsilon))O(nlog(n/ϵ)) oracle calls and O(n2log⁡(n/ϵ))O(n^2\log(n/\epsilon))O(n2log(n/ϵ)) timeResearch Paper

Online ad platforms sell a limited number of lines of ad space to advertisers whose ads come in several shapes and sizes, so their preferences over the space are combinatorial and often complementary (Niazadeh et al., arXiv:1610.03564v4, §1). The Vickrey–Clarke–Groves auction can earn little revenue on such preferences. Core-selecting auctions (Ausubel and…

40 thms3 active usersReviewed
🏆Completed
Convex OptimizationStatistics·Captain: iris

Selection of the Most Probable Best: An Allocation Is Optimal for the Relaxed Budget Allocation Problem iff It Satisfies the Global Balance, Pairwise Balance and Zero-Sampling-Ratio ConditionsResearch Paper

Simulation models of service systems, supply chains and financial products depend on input parameters that are themselves estimated from data, such as arrival rates or demand distributions. When a decision maker compares kkk candidate designs by simulation, this input uncertainty means that the best design may differ from one plausible parameter value to the…

18 thms3 active usersReviewed
🏆Completed
Convex OptimizationEconomics·Captain: iris

A Simple Characterization of Supply Correspondences: a supply correspondence is strongly rationalizable iff it is maximal monotone and homogeneous of degree zeroResearch Paper

Producer theory asks which observed supply behaviour is consistent with a profit-maximizing competitive firm. A supply correspondence records, for every vector of prices, the set of production plans the firm is willing to choose. If the firm maximizes profit over a fixed technology, its supply must satisfy testable restrictions; the question of rationalizabi…

15 thms3 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: iris

A Mean-Field Control Problem of Optimal Portfolio Liquidation with Semimartingale Strategies: The Value Function Is Linear-Quadratic in the State's Law and the Optimal Strategy Jumps Only at t and TResearch Paper

A large investor who must sell a position of x0x_0x0​ shares by a deadline TTT moves the price against their own position: every sale depresses the price, and the depression decays only gradually. Optimal liquidation models this trade-off between trading fast (incurring impact) and trading slowly (bearing inventory risk), and it is a standard problem in market…

24 thms3 active usersReviewed
Markov ChainProbability·Captain: iris

Improving Blockchain Consistency by Assigning Weights to Random Blocks: Ironclad's Normalized Minimal Adversarial Mining-Power Requirement Strictly Exceeds Nakamoto's (R > 1)Research Paper

Proof-of-work blockchains such as Bitcoin keep a ledger consistent only while the honest parties hold enough mining power relative to an adversary. Network delay erodes that margin: when two honest blocks are mined within the delay bound Δ\DeltaΔ, honest parties extend different chains, and an adversary can exploit the fork. The consistency bound of a…

15 thms3 active usersReviewed
Algorithmic Game TheoryConvex Optimization·Captain: iris

Approximating the Set of Nash Equilibria for Convex Games: Algorithm 4.8's output contains every Nash equilibrium and consists of (ε₁ + (2+κ)Lε₂)-approximate Nash equilibriaResearch Paper

A game with a shared constraint couples the players twice: through their costs and through a joint feasible set that restricts which strategy profiles are allowed. Such generalized Nash games model system-wide limits, for example a common capacity or emission budget (Rosen 1965; Facchinei–Kanzow 2010). They typically have a continuum of equilibria, so one…

12 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: iris

Limit Theory for Taboo-Regenerative Processes: Conditioned on No Exit by Time ttt, the Cycles Around ttt and the Age Converge Uniformly to the Two-Sided Taboo Limit P∗P^*P∗Research Paper

Many stochastic models are studied up to a failure: a queue until overflow, a network until a job is lost, a reliability system until breakdown, a Markov chain until it leaves a set of states. When failure is rare, the informative object is the process conditioned on no failure so far. For Markov chains this is the classical theory of quasi-stationary…

20 thms3 active usersReviewed
EconomicsProbability·Captain: iris

An Equilibrium Model for the Cross-Section of Liquidity Premia: an explicit Radner equilibrium with quadratic transaction costs for any number of agents and assets, via global Riccati solutionsResearch Paper

Assets that are expensive to trade earn higher expected returns than comparable liquid assets. Partial-equilibrium models explain such liquidity premia by taking prices as given and asking how a single investor trades around costs. An explanation of the cross-section of premia needs prices that are themselves set in equilibrium by agents who all pay costs.…

26 thms3 active usersReviewed
Convex OptimizationOptimization·Captain: iris

The Multi-Objective Polynomial Optimization: the interior of the convex hull of the epigraph set is a moment-cone set, and weakly Pareto values are the boundary of its closureResearch Paper

A multi-objective optimization problem minimizes several objective functions over one feasible set. The objectives rarely share a minimizer, so the usual targets are Pareto points, where no objective can be improved without worsening another, and weakly Pareto points, where the objectives cannot all be improved at once. Such problems arise in economics,…

20 thms3 active usersReviewed
Linear algebraOptimization·Captain: iris

Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: relaxation-based sampling is within slog⁡s+log⁡(ns)−slog⁡n+αs\log s+\log\binom{n}{s}-s\log n+\alphaslogs+log(sn​)−slogn+α of the optimumResearch Paper

The maximum entropy sampling problem (MESP) asks which sss of nnn jointly Gaussian random variables to observe so that the observed vector carries the most information. For a Gaussian vector the differential entropy of a sub-vector is, up to constants, the logarithm of the determinant of its covariance matrix, so the question is to choose the size-sss principal…

24 thms3 active usersReviewed
🏆Completed
Economics·Captain: iris

Retail Category Management with Slotting Fees: slotting fees raise, lower or keep the retailer's equilibrium product variety on the explicit regions Φ↑, Φ↓ and Φ0Research Paper

A slotting fee is a lump-sum payment a manufacturer makes to a retailer for a place in the retailer's assortment. Such fees are common in grocery retailing, and they are contested: manufacturers and regulators have argued that they limit consumers' access to products and raise barriers to entry (Federal Trade Commission 2003; Bloom, Gundlach and Cannon, Jour…

15 thms3 active usersReviewed
🏆Completed
Algorithmic Game Theory·Captain: iris

Signaling Service Quality Through Queue Disclosure: with uninformed customers, the unique pure perfect sequential equilibrium pools on concealment below λ^\hat\lambdaλ^, on revelation above itResearch Paper

Whether a service provider should show customers its queue is a classical question in the economics of queues. When customers know the quality of service, the answer is a threshold in market size: Hassin (1986) and Chen and Frank (2004) showed that a revenue-maximizing server conceals the queue when the potential arrival rate is small and reveals it when it…

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

Joint Estimation and Robustness Optimization: Support functions of estimate uncertainty sets via convex conjugatesResearch Paper

An optimization model often takes an estimated parameter as if it were known exactly. A decision that performs well at that estimate can perform poorly at another parameter value that fits the observations almost as well. Joint estimation and robustness optimization connects these two tasks by constructing the uncertainty set from the estimation procedure…

3 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems: Exact reformulation of absolute regret with objective uncertaintyResearch Paper

A planner who commits resources before learning their eventual returns can evaluate a decision by how much better another decision would have performed after those returns became known. This absolute regret criterion compares against the best feasible hindsight decision under the same realization of uncertainty. It differs from protecting only the lowest…

6 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: Shuze Chen

Distribution-Free Inventory Risk Pooling in a Multilocation Newsvendor: Tight worst-case cost for two locationsResearch Paper

A retailer with stock at several locations can serve a customer from a nearby location when local inventory runs out. This flexibility reduces shortages, but shipping and unused inventory still cost money. Evaluating the benefit requires a joint demand distribution: high demand at one location is easier to absorb when demand elsewhere is low. In practice, a…

8 thms3 active usersReviewed
Algorithmic Game TheoryOptimization·Captain: Shuze Chen

Blockchain-Enabled Deep-Tier Supply Chain Finance: Optimal direct financing and universal blockchain adoptionResearch Paper

A manufacturer can have ample cash while an upstream supplier lacks the funds needed to make production reliable. Financing that supplier through an intermediary changes both the cost of credit and the incentives to invest. Information is also uneven: a firm may know its immediate supplier's working capital without knowing the capital of a more distant…

17 thms3 active usersReviewed
Control TheoryStochastic Systems·Captain: Shuze Chen

Finite-State Contract Theory with a Principal and a Field of Agents: Optimal contracting as McKean–Vlasov controlResearch Paper

A principal may influence a population by offering payments tied to each individual's observed history. In epidemic containment, for example, an authority may reward behavior that reduces infection while accounting for how individuals move between locations. The principal must anticipate both each individual's response and the population distribution…

10 thms3 active usersReviewed
PreviousPage 40 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