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
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

On the Optimal Dividend Problem for a Spectrally Negative Lévy Process I: Optimality of the Barrier Strategy at c* in the Classical Dividend ProblemResearch Paper

An insurance company's surplus grows with premiums and falls with claims. In the Cramér–Lundberg model with a positive safety loading, the surplus drifts to +∞+\infty+∞ with probability one. De Finetti (1957) objected that a company does not accumulate capital indefinitely: surplus above some level is paid out to shareholders. He proposed choosing the payout…

2,590 thms12 active usersReviewed
Complexity TheoryOptimization·Captain: iris

The Computational Complexity of Avoiding Strict Saddle Points in Constrained OptimizationResearch Paper

Nonconvex optimization over a polytope, min⁡x∈Xf(x)\min_{x\in\mathcal X} f(x)minx∈X​f(x) with X={x∈Rd:Ax≤b}\mathcal X=\{x\in\mathbb R^d: Ax\le b\}X={x∈Rd:Ax≤b}, is the basic model behind constrained training problems and many operations-research formulations. Gradient methods reach first-order stationary points, but these include strict saddle points, which degrade solutions in practice. The usual remedy…

98 thms11 active usersReviewed
Complexity TheoryOptimization·Captain: mikedeng1

Multi-purchase Behavior: Modeling, Estimation, and Optimization: Revenue Maximization under the BundleMVL-2 Multi-Purchase Choice Model Is NP-CompleteResearch Paper

Recommendation platforms and online retailers choose which products to show a customer, and customers often buy more than one of them in a single visit. Classical choice models such as the multinomial logit (MNL) assume a customer buys at most one product, and under MNL the revenue-maximizing set of products to display is easy to find: it is one of the nnn rev…

29 thms10 active usersReviewed
CombinatoricsProbability·Captain: Shuze Chen

The Komlos ConjectureOpen Problem

Discrepancy theory asks how evenly a collection of objects can be split into two parts. Its central open question is a conjecture of Komlós, first circulated in the 1980s: any finite family of vectors of Euclidean length at most one can be signed ±1\pm 1±1 so that the signed sum is bounded in every coordinate by a universal constant — independent of how many…

25 thms10 active usersReviewed
CombinatoricsConvex OptimizationTheoretical Computer Science·Captain: iris

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing: Weighted-Balanced-Utilization Is 3/4-Competitive Against Both the Optimum Offline and the Optimum OnlineResearch Paper

Ride-hailing platforms match drivers to riders in batches. When a batch is cleared, some riders are already waiting (the first stage), while others may request a ride in the next few minutes (the second stage). A driver assigned now is unavailable later, so the platform has to decide how much supply to commit to current demand without knowing which future…

21 thms6 active usersReviewed
Dynamic ProgrammingLinear Optimization·Captain: iris

On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs: State-Independent, Totally Unimodular Linking Constraints Make the Lagrangian and ALP Upper Bounds EqualResearch Paper

Many sequential decision problems in operations research consist of a large number of otherwise independent subproblems that interact only through a few resource constraints in each period: arms of a restless bandit sharing a budget of activations, legs of an airline network sharing seat inventories, servers sharing a matching budget. These are weakly…

18 thms6 active usersReviewed
Algorithmic Game TheoryMachine LearningOptimization·Captain: iris

Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization: Robust, Blackwell-Reducible Greedy Algorithms Yield Online γ\gammaγ-Regret O(D(p)NδTlog⁡d)O(D(p)N\delta\sqrt{T\log d})O(D(p)NδTlogd​)Research Paper

Many combinatorial and continuous optimization problems in revenue management and machine learning are NP-hard but admit a simple greedy γ\gammaγ-approximation: build the solution in NNN stages, and in each stage take the locally best step. Submodular maximization (Nemhauser, Wolsey and Fisher, 1978), product ranking and reserve-price optimization are examples.…

33 thms6 active usersReviewed
Algorithmic Game TheoryComplexity Theory·Captain: iris

Efficient Fair Division with Minimal Sharing: For Fixed nnn, Sharing-Minimal Fair fPO Allocations Are Computable in O(3n(n−1)Dv/2mn(n−1)/2+2)O(3^{n(n-1)D_v/2} m^{n(n-1)/2+2})O(3n(n−1)Dv​/2mn(n−1)/2+2) Operations and NP-Hard at Polynomial DegeneracyResearch Paper

Fair division of divisible resources is usually solved by convex optimization or market equilibrium, and the resulting allocations typically split many objects among several agents. In practice splitting is costly: a house, a car or a work shift is shared only by co-ownership or time-sharing. Sandomirskiy and Segal-Halevi (arXiv:1908.01669v3, Operations…

22 thms6 active usersReviewed
OptimizationProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation VI: a log-concave density has decreasing mean residual life, which makes conditional-expectation constraints linearTextbook

Stochastic linear programming asks for decisions xxx whose outcomes depend on a random quantity, and a central modelling question is how to bound the risk of loss. Chapter 2 of Kall and Mayer's Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer, 2005) compares several answers. A plain chance constraint limits how often a loss…

23 thms6 active usersReviewed
Algorithmic Game TheoryFunctional AnalysisOptimization·Captain: mikedeng1

Side-Constrained Dynamic Traffic Equilibria: Under Edge-Load Capacities, Strong Dynamic Larsson-Patriksson and Marcotte-Nguyen-Schoeb Equilibria Exist (Departure-Time Choice)Research Paper

Dynamic traffic assignment predicts how travellers choose routes and departure times when travel times depend on the traffic itself. Its central solution concept, the dynamic user equilibrium, asks that no particle of flow can lower its cost by switching to another route or departure time. Existence of such equilibria in continuous time is classical: Friesz…

13 thms6 active usersReviewed
OptimizationStatistics·Captain: mikedeng1

Offline Pricing and Demand Learning with Censored Data: a data-driven pricing problem is identifiable if and only if the optimistic and pessimistic prices coincideResearch Paper

A retailer who sets a price for a product with limited inventory usually learns about demand from past sales. When the shelf runs empty, sales record the inventory level rather than the demand. Demand above the stock is lost and never observed. This demand censoring is pervasive in retail and inventory data, and it biases naive estimators of demand curves…

17 thms6 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

A (Slightly) Improved Approximation Algorithm for Metric TSP: Max-Entropy Spanning Tree Plus Odd-Vertex Matching Costs at Most (3/2 − ε)·OPT in Expectation, ε > 10⁻³⁶Research Paper

The metric traveling salesperson problem asks for the cheapest tour through a finite set of cities whose pairwise costs are symmetric and satisfy the triangle inequality. The classical Christofides–Serdyukov algorithm combines a spanning tree with a matching on its odd-degree vertices and has a worst-case guarantee of 3/23/23/2 times the optimal tour cost.…

20 thms6 active usersReviewed
Dynamic ProgrammingMarkov ChainStochastic Systems·Captain: mikedeng1

Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs: A Variable-Rate Queue Has an Average Cost Optimal Stationary Policy Whenever λ < max aβResearch Paper

Controlled queues are the standard testing ground for Markov decision processes with infinitely many states: the state is a queue length, which is unbounded, and the holding cost grows with it. The classical theory of the average cost criterion (Ross, Applied Probability Models with Optimization Applications, 1970) produces an optimal stationary policy only…

27 thms6 active usersReviewed
Linear OptimizationOptimizationTheoretical Computer Science·Captain: ORdos

Smale's Ninth Problem: Strongly Polynomial Linear ProgrammingOpen Problem

The linear feasibility problem takes a matrix A∈Rm×nA \in \mathbb{R}^{m\times n}A∈Rm×n and a vector b∈Rmb \in \mathbb{R}^mb∈Rm and asks whether the system of mmm linear inequalities in nnn real unknowns

29 thms6 active usersReviewed
OptimizationTheoretical Computer Science·Captain: mikedeng1

Exact Sum-of-Radii Clustering under Any Constant StabilityResearch Paper

A coverage system can assign demand points to facilities with different service radii. The minimum sum-of-radii objective measures the sum of those radii rather than the largest radius or the total distance to facilities. Its optimization problem fixes the number of clusters, so making one cluster cheaper can compensate for making another more expensive.…

173 thms5 active usersReviewed
Complexity TheoryComputational GeometryMachine Learning·Captain: Shuze Chen

Exact Euclidean k-Means: Faster in the Plane, Hard Beyond ItResearch Paper

Exact Euclidean k-means asks for the least possible sum of squared distances from data points to freely located centers. Two parameters shape the problem: the number of centers, k, and the ambient dimension, d. An algorithm whose exponent depends on their product can be polynomial for every fixed pair and still become impractical as either parameter grows.…

26 thms5 active usersReviewed
Combinatorics·Captain: mikedeng1

Kawamura's pinwheel density conjecture holds for smallest period at most five and fails from sixResearch Paper

A pinwheel instance asks whether a single machine, doing one task per day, can visit each task often enough that task iii occurs in every window of aia_iai​ consecutive days. The problem models periodic servicing such as the perpetual maintenance of machines (arXiv:2202.01567), and its central question is how much of the machine's capacity can be promised in…

959 thms5 active usersReviewed
Machine LearningOptimizationTheoretical Computer Science·Captain: iris

Computational Complexity of Data-Driven Configuration for Integer Programming, Clustering, and Learning AlgorithmsResearch Paper

Integer programming solvers expose parameters, and in practice they are run on many instances of one application. Data-driven algorithm configuration asks for parameters that perform well on a training set of instances. For cutting planes, Balcan, Prasad, Sandholm and Vitercik (2021) bound the sample complexity of tuning Chvátal–Gomory cuts: how many…

55 thms5 active usersReviewed
Algorithmic Game Theory·Captain: iris

An O(loglogn) Upper Bound on the Price of Stability for Undirected Multicast Shapley GamesResearch Paper

In a network design game each user must connect a source to a destination in a shared network, and the cost of every link that is built is split among the users who route through it. A central planner would pick the routing of least total cost; the users instead pick routes that minimize their own payment, and the two goals can disagree. The price of…

31 thms5 active usersReviewed
Complexity TheoryProbability·Captain: iris

Impatience Makes Matching NP-HardResearch Paper

Ride-hailing platforms, online labour marketplaces, organ-allocation systems and quantum switches all match two sides of a market whose agents do not wait forever. The standard abstraction is a bipartite queueing system: agents of finitely many types arrive over time, the platform decides which compatible pairs to match, and an unmatched agent leaves when…

32 thms5 active usersReviewed
Complexity TheoryGraph TheoryTheoretical Computer Science·Captain: iris

Approximation and Hardness for the Data Validation ProblemResearch Paper

Precedence-constrained scheduling takes a partial order on tasks as input, yet in practice the order is rarely known with full confidence. In product design, assembly, project scheduling and construction, the relation between two tasks is often not documented, and an expert must be consulted to determine it. For automotive assembly, probing direct…

36 thms5 active usersReviewed
CombinatoricsComplexity Theory·Captain: iris

Additive Ω(log⁡∗OPT)\Omega(\log^* OPT)Ω(log∗OPT) Gap for Bin Packing with Three Items per BinResearch Paper

In bin packing, items with sizes in (0,1](0,1](0,1] must be partitioned into bins of total size at most one, using as few bins as possible; OPT(I)\mathrm{OPT}(I)OPT(I) is that minimum. The problem is strongly NP-hard even in the 3-partition regime, where every size lies in (1/4,1/2)(1/4,1/2)(1/4,1/2) and a bin holds at most three items, so research has concentrated on additive guarantees …

28 thms5 active usersReviewed
Dynamic ProgrammingOptimizationProbability·Captain: iris

Markov Decision Processes with Applications to Finance IX: Multiperiod Indifference Prices under Exponential Utility Are Given by a Backward RecursionTextbook

In a complete market every contingent claim has one arbitrage-free price, the cost of replicating it. When part of the risk sits in an asset that cannot be traded, replication fails and arbitrage arguments leave an interval of prices. Indifference pricing selects a price from the seller's preferences: the price at which an investor with a given utility…

31 thms5 active usersReviewed
Convex OptimizationOptimizationProbability·Captain: iris

Markov Decision Processes with Applications to Finance IV: A One-Period Market Has an Optimal Portfolio for Every Wealth If and Only If It Admits No ArbitrageTextbook

Every portfolio problem in discrete-time mathematical finance starts from a market model and asks two questions: is the market free of arbitrage, and does an investor with a given utility function have an optimal portfolio? The two questions are linked. If a riskless strategy with a chance of gain exists, an investor with strictly increasing utility can…

23 thms5 active usersReviewed
Dynamic ProgrammingOptimizationProbability·Captain: iris

Markov Decision Processes with Applications to Finance I: Under the Structure Assumption the Value Functions Solve the Bellman Equation and Every Sequence of Maximizers Is an Optimal PolicyTextbook

Sequential decisions under uncertainty appear in inventory control, portfolio choice, consumption planning and optimal stopping. The common model is the Markov Decision Model: a controller observes a state, picks an action, collects a reward, and the system moves at random to a new state. The standard solution method, backward induction, goes back to…

29 thms5 active usersReviewed
PreviousPage 1 of 39Next

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