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 TheoryComputational Complexity·Captain: Shuze Chen

When Are Elections with Few Candidates Hard to Manipulate?: Non-plurality positional scoring is NP-complete to manipulate with three candidatesResearch Paper

A voting rule aggregates submitted preferences into a collective choice. A coalition can sometimes change that choice by coordinating its submitted rankings. The computational question is whether it can efficiently determine how to make a particular candidate win. This matters in collective decision systems where an agent's voting weight can represent…

6 thms4 active usersReviewed
🏆Completed
Complexity TheoryDiscrete GeometryOptimization·Captain: mikedeng1

Mixed-integer Quadratic Programming is in NP: Every Feasible Mixed-Integer Quadratic System Has a Feasible Solution of Polynomial Bit-SizeResearch Paper

Mixed-integer quadratic programming (MIQP) asks to minimize a quadratic function over the points of a polyhedron whose first ppp coordinates are integers. It contains integer linear programming, quadratic programming and combinatorial problems such as max-cut.

9 thms4 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Optimal Pricing with a Single Point: Closed-Form Maximin Ratio and Optimal Deterministic Price Against Regular and MHR DistributionsResearch Paper

A seller who has posted a price www for some time usually knows one number about demand: the conversion rate qqq, the fraction of customers who bought at www. Whether that single number is enough to price well, and how well, is a basic question of data-driven pricing. Allouah, Bahamou and Besbes (arXiv:2103.05611, Management Science 2023) answer it in a robust,…

13 thms4 active usersReviewed
OptimizationProbability·Captain: mikedeng1

Production Planning with Risk Hedging under a CVaR Objective: The Unique Optimal Capacity and Target Are ((Q°)⁺, m°) When the Hedging Budget C ≥ C°, Else the Budget Binds and m* = pQ* − CResearch Paper

A firm that commits to a production quantity QQQ before demand is known faces the classical newsvendor trade-off between overstock and lost sales. When demand moves with the price of a traded asset, such as farm-equipment sales with corn futures or car sales with a stock index, part of the demand risk can be hedged in the financial market. Wang and Yao (SSRN…

16 thms4 active usersReviewed
Markov ChainProbabilityStochastic Systems·Captain: mikedeng1

Lyapunov Conditions for Differentiability of Markov Chain Expectations: Differentiability of Random-Horizon Discounted ExpectationsResearch Paper

Many performance measures of stochastic models in operations research are expectations computed along a Markov chain until a random time. Examples are the expected discounted cost until a queue empties, the expected reward until a system enters a failure set, and the price of a claim that pays at a hitting time. When the transition law depends on a…

11 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability+1·Captain: mikedeng1

Stochastic First-Order Methods for Average-Reward Markov Decision Processes: Stochastic Policy Mirror Descent Attains Expected Average-Cost Gap κ√(log|A|/K) + ς on Mixing AMDPsResearch Paper

Many control problems in operations research have no natural horizon and no natural discount rate: a queue, an inventory system or a communication network runs indefinitely, and what matters is the cost it incurs per period in the long run. The average-reward Markov decision process (AMDP) is the standard model for these problems (Puterman, 2014, Ch. 8).…

13 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph: Symmetric Strategies Wait at Least (n+1)/2 + 2⁻³⁶nResearch Paper

Rendezvous search asks how two agents who cannot communicate should move so as to meet as soon as possible. Alpern posed the problem in 1976, and it became a standard topic in search games (Alpern and Gal, The Theory of Search Games and Rendezvous, 2003). Its simplest discrete version is played on the complete graph KnK_nKn​: there are nnn locations, every…

15 thms4 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Stationary Discounted and Ergodic Mean Field Games with Singular Controls: The Discounted Equilibria and Their Rescaled Values Converge to the Ergodic Equilibrium as the Discount Rate VanishesResearch Paper

Firms invest to raise their productivity, investment is irreversible, and the return on productivity depends on what the rest of the market does. Cao, Dianetti and Ferrari model this as a stationary mean field game (MFG) of singular control: a representative firm controls a one-dimensional diffusion through a nondecreasing investment process. Its running…

19 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis: Sparsity Theorem, the Closed-Form Minimizer of a Symmetric Gauge over Sparse Weak MajorantsResearch Paper

Many problems in statistics and signal processing ask for a vector that is both small in some norm and sparse, with at most KKK nonzero entries. The best-known example is sparse principal component analysis (sparse PCA), whose feasible set is the set of unit vectors in the Euclidean norm with at most KKK nonzero entries (d'Aspremont et al. 2007). Cardinality…

13 thms4 active usersReviewed
Machine LearningStatistics·Captain: mikedeng1

Fixing Inventory Inaccuracies at Scale: The Entrywise Algorithm's Expected Anomaly-Detection Cost Is Within O(log^1.5(m)/√m) of the Optimal CostResearch Paper

Retail inventory records are often wrong. A store's system may report units on the shelf that are not there (phantom inventory), so the replenishment system never reorders and the product silently stops selling. Audits fix such errors but are expensive, so a retailer wants to decide which store–SKU pairs to audit from sales data alone. The classical way,…

16 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Approximation and Convergence of Large Atomic Congestion Games: Equilibria of Bernoulli Congestion Games Converge to Poisson Flows Whose Means Are Wardrop Equilibria of a Limit GameResearch Paper

Traffic models in transportation and network design come in two kinds. Nonatomic congestion games, with Wardrop equilibria, treat traffic as a continuum of infinitesimal users. Atomic games have finitely many players, each with a non-negligible effect on congestion. The Wardrop model is the one used in practice, and the usual justification is that it is the…

14 thms4 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

M♮-Convexity and Its Applications in Operations: Optimal Solutions Are Nonincreasing in the Parameters for SSQM♮-Concave Objectives on a BoxResearch Paper

Many operations models ask how an optimal decision moves when a parameter moves. The classical answer is lattice programming (Topkis 1998): when the objective is supermodular, so that decisions and parameters are complements, optimal solutions are nondecreasing in the parameters. Inventory, assortment and resource-allocation problems often have the opposite…

11 thms4 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems: In Moderate Overload, Dedicated Queues Under JSQ Match Pooled Abandonment While Their Delay Probability Stays Below OneResearch Paper

Large service systems (call centers, hospital wards, emergency departments) must decide how customers wait. In a pooled queue (PQ) all customers wait in one line served by nnn agents; in dedicated queues (DQ) each server has its own line, which is what physical layouts, server-specific information and accountability often force. Classical queueing theory says…

18 thms4 active usersReviewed
🏆Completed
CombinatoricsDynamic Programming·Captain: mikedeng1

Assortment Optimization Under Consider-then-Choose Choice Models: the dynamic program's state space has at most min(2^N, N·2^K) subproblemsResearch Paper

Assortment optimization asks a retailer which subset of products to offer so as to maximize expected revenue, given a model of how customers choose among what is offered. A widely used class of choice models in operations management describes customers by ranked preference lists: each customer type buys the highest-ranked product on offer, or nothing (Farias…

12 thms4 active users
🏆Completed
Stochastic SystemsTheoretical Computer Science·Captain: mikedeng1

Tail-Optimized Caching for LLM Inference: Expected-Tail-Optimized LRU Is an Optimal Online Caching Policy for Tail Excess Latency in the Stochastic Conversation ModelResearch Paper

A large language model serving a multi-turn conversation re-reads the whole conversation history at every turn. The intermediate attention state of that history, the KV cache, can be stored in GPU memory and reused, so that only the uncached part of the prompt must be recomputed before the first output token appears. GPU memory is scarce, so a server must…

8 thms4 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Efficient Online Linear Optimization with Approximation Algorithms: Online Gradient Descent with Infeasible Projections onto CH(αK) Has Expected α-Regret at Most α²R²/(Tη) + ηF²/2 + 3FεResearch Paper

Many sequential decision problems have a combinatorial action set: each round a decision maker picks a route, a schedule or a cut, and only afterwards learns its cost. When the offline problem — minimize a known linear cost over the action set — is NP-hard, the best available tool is an approximation algorithm, which returns a feasible action whose cost is…

13 thms4 active users
🏆Completed
Convex OptimizationFunctional AnalysisOptimization+1·Captain: Shuze Chen

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

Risk functionals assign a number to an uncertain profit and are used as objectives and constraints in portfolio selection, insurance and energy planning. Since the axiomatization of coherent risk measures by Artzner, Delbaen, Eber and Heath (Math. Finance 1999), the standard way to understand such a functional is through a dual representation: the…

9 thms4 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Stochastic Networks X: Stationary Open Migration Processes Under Time ReversalTextbook

A network of queues records both how many customers occupy each location and how they move between locations. These are different kinds of information. A simple distribution for the occupancies at one time need not make the arrival streams simple, or make the queues independent over time. Open migration processes provide a setting in which the distinction…

10 thms4 active usersReviewed
🏆Completed
OptimizationReinforcement Learning·Captain: Shuze Chen

Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization: Global linear convergence of exact natural policy gradientResearch Paper

A decision maker repeatedly chooses an action, receives a reward, and moves to another state. A policy specifies how to randomize the next action in each state. Optimizing these choices directly is a central approach to reinforcement learning, but the resulting objective need not be concave in its policy parameters. A useful convergence guarantee must…

19 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Robust Optimization VII: Exact Robust LMIs with Norm-Bounded UncertaintyTextbook

A design constraint may require a symmetric matrix to remain positive semidefinite even when some of its coefficients are uncertain. Such constraints arise in the structural design problems discussed in Chapter 8 of Ben-Tal, El Ghaoui and Nemirovski, Robust Optimization. A design that satisfies a constraint at the nominal data can fail after a perturbation.…

3 thms4 active usersReviewed
Algorithmic Game Theory·Captain: mikedeng1

Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks: A Dynamic Equilibrium Reaches a Steady State in Finite Time When the Inflow Is at Most the Minimum Cut CapacityResearch Paper

Traffic and packet networks are congested over time, not only on average. The fluid queuing model (Vickrey's bottleneck model on a network) captures this: every arc of a network is a bottleneck queue followed by a link of fixed length. Users entering at a source choose routes so as to arrive at the destination as early as possible, given the queues that the…

13 thms4 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Role of Risk Aversion in Price Postponement Under Supply Random Yield: Ex Ante and Responsive Pricing Share One CVaR Risk-Aversion ThresholdResearch Paper

Many manufacturing processes deliver only a random fraction of what they start: semiconductor wafers, biologics, agricultural produce and recycled materials all suffer random yield. A firm facing yield risk has two classical levers. It can inflate production to hedge against low yield, and it can postpone pricing until the yield is observed, so that the…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Gradient-Based Algorithms for Convex Discrete Optimization via Simulation: Truncated Stochastic Subgradient Descent with Rounding Finds an (ε, δ)-Good Solution of Stochastic Submodular MinimizationResearch Paper

Many operations decisions are made over discrete, high-dimensional choices whose cost can only be estimated by simulation: how many bikes to place at each station, which subset of facilities to open, how to allocate servers in a queueing network. Each evaluation of a candidate decision is a noisy run of a simulator, and the goal is to select a decision…

15 thms4 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Sales Information Transparency and Trust in Repeated Vertical Relationships: Sharing Past Sales Information Benefits the Retailer if and only if Its Discount Factor Is at Most 1/(1+√(1+p))Research Paper

A manufacturer that sells through a retailer usually knows less about end-customer demand than the retailer does. In the classical one-shot screening model (Laffont and Martimort, 2002) the manufacturer offers a menu of quantity–payment pairs, pays the well-informed retailer an information rent to reveal high demand, and distorts the low-demand quantity…

12 thms4 active usersReviewed
🏆Completed
EconomicsMechanism Design·Captain: mikedeng1

Simple and Approximately Optimal Contracts for Payment for Ecosystem Services: A Linear Contract with Per-Unit Price k/2 Achieves at Least Half of the Optimal Contract PayoffResearch Paper

Payments for ecosystem services compensate landowners for conservation that a program values but cannot directly provide. A contract designer must decide how to pay when landowners differ in the amount of forest they would conserve without a payment. That baseline conservation type is privately known, so a contract can pay for forest that would have…

6 thms4 active usersReviewed
PreviousPage 17 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