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,667 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

Open947Completed2667All3614
🏆Completed
EconomicsMechanism DesignOptimization+1·Captain: mikedeng1

Selling Data to Marketers 3: Under the Rotation Order, Marketing Lists Serve Low-Cost Marketers Efficiently and Over- (Under-) Supply High-Cost Ones Below (Above) the Rotation PointResearch Paper

Data brokers sell two kinds of products to marketers. A marketing list supplies the contacts a marketer needs in order to act at all; a data append enriches a list the marketer already holds. In both cases the broker can also choose how informative its accompanying analytics are, and it can price a menu of plans of different informativeness to marketers…

10 thms2 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Stability of a Queue Fed by Scheduled Traffic at Critical Loading 1: The Critically Loaded S/D/1 Workload Converges to a Finite Limit If and Only If the Perturbations Are Bounded AboveResearch Paper

Many service systems do not receive random, memoryless traffic: customers are given appointments. Outpatient clinics, airport runways, container terminals and delivery slots all schedule arrivals on a regular grid, and the actual arrival deviates from the appointment by a random lateness or earliness. A queue fed by such scheduled traffic is a basic model…

14 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

Thompson Sampling with Information Relaxation Penalties III: As T → ∞ the Action Laws of IRS.FH and IRS.V-Zero Converge to That of Thompson SamplingResearch Paper

Thompson sampling (TS) is the standard randomized heuristic for the Bayesian multi-armed bandit: at each decision it samples a parameter vector from the current posterior and pulls the arm that would be best if the sample were true. It ignores the remaining horizon. Min, Maglaras and Moallemi (arXiv:1902.04251, Management Science, 2025) obtain horizon-aware…

9 thms2 active usersReviewed
🏆Completed
Linear OptimizationStatistics·Captain: mikedeng1

Reducing Marketplace Interference Bias Via Shadow Prices 1: In a Symmetric Experiment the Shadow-Price Estimator Is No More Biased Than the RCT Estimator in the Fluid LimitResearch Paper

Online marketplaces (ride hailing, delivery, freelancing, retail supply chains) test changes to their product with randomized controlled trials: a fraction ρ\rhoρ of the arriving customers is treated, the rest is kept as control, and the difference in outcomes is scaled up to estimate what would happen if everybody were treated. In a market with limited…

8 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOptimization·Captain: mikedeng1

The Value of Information Design in Supply Chain Management IV: With Disjoint Supports, Full Disclosure Is Optimal When 2(b₀ − a₀) ≥ b₁ − a₁, Else No Disclosure at p₀ ≥ p̃ and Partial BelowResearch Paper

A retailer usually knows more about her future demand than the supplier who has to produce for her. If the supplier must commit to a production quantity before the order arrives, the retailer bears the cost of every unit he fails to produce. She cannot pay him or contract on quantities, but she can decide how much of her demand information to share, and she…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOptimization·Captain: mikedeng1

The Value of Information Design in Supply Chain Management II: Under Partial Disclosure the Value of Information Is Unimodal in p₀ and Falling in ξ Against No Disclosure, the Reverse Against FullResearch Paper

A retailer often knows more about her own demand than the supplier who produces for her. When the supplier must commit to a production quantity before demand is realized, what the retailer tells him shapes how much he produces, and therefore how much demand she can serve. Information design (Bayesian persuasion, Kamenica and Gentzkow, 2011) asks how a…

11 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOptimization·Captain: mikedeng1

The Value of Information Design in Supply Chain Management I: With Nested Uniform Demand Supports, Full, No or Two-Message Partial Disclosure Is Optimal According to Critical-Ratio ThresholdsResearch Paper

A retailer who sees her own demand before her supplier does can decide how much of that knowledge to pass upstream. Sharing everything is not obviously best: the supplier uses the information to set his production quantity for his own benefit, and the retailer bears a cost when he under-produces. Candogan and Gurkan (SSRN 4378997; published in Management…

8 thms2 active usersReviewed
🏆Completed
EconomicsMechanism DesignOptimization+1·Captain: mikedeng1

Selling Data to Marketers 4: Under the Rotation Order, Data Appends with Costs Below the Prior Mean Serve High-Cost Marketers Efficiently and Under- (Over-) Supply Low-Cost Ones Below (Above) v⁺Research Paper

Data brokers sell consumer data to firms that use it to decide whom to target, whom to lend to, or where to open a store. Two kinds of products are common: a marketing list, which supplies contact information without which the buyer cannot act at all, and a data append, which enriches information about consumers the buyer can already reach (Federal Trade…

9 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningReinforcement Learning·Captain: mikedeng1

Corruption-Robust Exploration in Episodic Reinforcement Learning I: Regret of SuperVIsed.C Is Bounded by the Bonus Sums of Its Critically Tolerant and Robust Base LearnersResearch Paper

Reinforcement-learning algorithms with regret guarantees, such as UCBVI (Azar, Osband & Munos 2017), assume that every episode is generated by the same Markov decision process. In practice a fraction of episodes can be generated by something else: fraudulent users of a recommender, sensor faults, a strategic participant. Corruption-robust learning asks for…

14 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOptimization·Captain: mikedeng1

Robust Markov Decision Processes: Beyond Rectangularity 2: With Polyhedral r-Rectangular Factor Sets, One Deterministic Policy and Factor Matrix Stay Robust-Optimal for All Discount Factors Near 1Research Paper

A Markov decision process (MDP) models sequential decisions under uncertainty: in each state a decision maker picks an action, collects a reward, and the system moves to a random next state according to a transition kernel. In applications the kernel is estimated from data, and an optimal policy for the estimated kernel can perform poorly under a slightly…

7 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

On the Optimality of Affine Policies for Budgeted Uncertainty Sets 3: With a Network Recourse Matrix, the Optimal Affine Policy Costs m/2 − 1 While the Adjustable Optimum Is 0Research Paper

A two-stage adjustable robust linear program chooses a first-stage decision xxx before an uncertain right-hand side hhh is revealed, and a second-stage (recourse) decision y(h)y(h)y(h) afterwards, minimising the worst case over an uncertainty set U\mathcal UU of the total cost. Computing the optimal value zAR(U)z_{AR}(\mathcal U)zAR​(U) is hard in general (Feige et al., 2007), and…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOptimization·Captain: mikedeng1

Robust Markov Decision Processes: Beyond Rectangularity 1: Under r-Rectangular Factor Uncertainty, Robust Value Iteration Converges to the Optimal Worst-Case Value, Attained by a Deterministic PolicyResearch Paper

A Markov decision process (MDP) is optimized for a transition kernel that, in practice, is estimated from data, and the optimal policy for the estimated kernel can perform poorly under small perturbations of it. The robust MDP approach replaces the single kernel by an uncertainty set of kernels and asks for the policy with the best worst-case expected…

12 thms2 active usersReviewed
🏆Completed
Linear OptimizationMechanism Design·Captain: mikedeng1

Optimal Design for Multi-Item Auctions: A Robust Optimization Approach: The Robust Optimal Mechanism Is Incentive Compatible, Budget Feasible and Individually RationalResearch Paper

Designing a revenue-maximizing auction for several items is hard once buyers have budgets. Myerson's optimal auction (Myerson 1981) solves the single-item problem without budgets, under a known prior on the buyers' values. With several items, correlated values or budget constraints, no comparable characterization is known, and the Bayesian formulation…

7 thms2 active usersReviewed
🏆Completed
OptimizationStochastic Systems·Captain: mikedeng1

Stochastic Dual Dynamic Integer Programming 1: With Valid, Tight and Finite Cuts, Stochastic Nested Decomposition Finds an Optimal Solution in Finitely Many Iterations with Probability OneResearch Paper

Multistage stochastic programs model decisions taken over time while uncertain data are revealed: generation scheduling in hydro-thermal power systems, capacity expansion, unit commitment, portfolio management. When the uncertainty is represented by a finite scenario tree, the problem becomes one very large deterministic program, and decomposition…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

Stochastic Dual Dynamic Integer Programming 2: Lagrangian Cuts from the Local-Copy Reformulation Are Valid and Tight at Binary StatesResearch Paper

Multistage stochastic integer programs model sequential decisions under uncertainty in which some decisions are discrete: unit commitment in power systems, capacity expansion, production planning with setups. Their linear (continuous) counterparts are routinely solved by nested decomposition methods such as stochastic dual dynamic programming (SDDP; Pereira…

8 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization IV: CAKKT-Regularity Implies Abadie's Constraint QualificationResearch Paper

Algorithms for smooth nonlinear programming, such as augmented Lagrangian, interior point and sequential quadratic programming methods, do not stop at exact Karush–Kuhn–Tucker (KKT) points. They stop at points where the KKT conditions hold approximately. Sequential optimality conditions make this precise: they are properties of sequences xk→x∗x^k\to x^*xk→x∗ with…

13 thms2 active usersReviewed
🏆Completed
OptimizationProbabilityStochastic Systems·Captain: mikedeng1

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements I: Average-Loss Bound for Deterministic Price ControlResearch Paper

Hotel rooms, rental cars, cloud servers, hospital beds and event spaces are reusable resources: a customer occupies a unit for a while and then returns it. Pricing them differs from classical revenue management, where a sold unit is gone for good. A sale now blocks capacity only for the length of the service, so the binding constraint is how many services…

8 thms2 active usersReviewed
🏆Completed
AnalysisTheoretical Computer Science·Captain: mikedeng1

Online Stochastic Matching: New Algorithms with Better Bounds 2: The Per-Advertiser Inequality Behind the 0.706 Ratio for General Arrival Rates, in the Limit f − s ≤ 1 − ln 2Research Paper

Online stochastic matching models display advertising and similar allocation problems in which requests arrive one at a time and must be served immediately. A bipartite graph links a set AAA of advertisers to a set III of impression types; nnn requests arrive, each of a type drawn independently with P(type i)=ri/n\mathbb P(\text{type } i) = r_i/nP(type i)=ri​/n, and each request must be…

20 thms2 active users
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

On the tightness of SDP relaxations of QCQPs 5: The Multiplicity Bound k ≥ aff dim{b(γ) : γ ∈ F} + 1 Cannot Be Lowered by OneResearch Paper

A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic inequality and equality constraints. QCQPs contain max-cut, binary programming, the trust-region subproblem and many problems from signal processing and control, and are NP-hard in general. The standard convex approach is the Shor semidefinite relaxation,…

11 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

On the tightness of SDP relaxations of QCQPs 4: Quadratic Eigenvalue Multiplicity k ≥ m + 1 Gives conv(D ∩ H) = D_SDP ∩ H and Opt = Opt_SDPResearch Paper

A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic inequality and equality constraints. QCQPs model trust-region subproblems, max-cut and other binary programs, phase retrieval, and many problems in signal processing and control; in general they are NP-hard. The standard tool for bounding and solving…

10 thms2 active usersReviewed
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Sinkhorn Distributionally Robust Optimization 1: Strong Duality — the Worst-Case Expectation over a Sinkhorn Ball Equals inf over λ ≥ 0 of λρ̄ + λε·E log E_Q[e^{f/(λε)}]Research Paper

Distributionally robust optimization (DRO) hedges a decision against uncertainty in the data distribution. It minimizes the worst-case expected loss over an ambiguity set of distributions around a nominal one, typically the empirical distribution of the data. Ambiguity sets built from the Wasserstein (optimal-transport) distance are standard in operations…

12 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach 3: Variable-Right-Hand-Side Production Cuts along a Precedence Chain Are ValidResearch Paper

Strategic open pit mine planning decides which parts of an ore body are excavated, in which period, and where each block of material is sent: to a processing plant, a stockpile or a waste dump. Rivera Letelier, Espinoza, Goycoolea, Moreno and Muñoz (Operations Research 68(5), 2020) state the problem as a mixed-integer program, the precedence-constrained…

7 thms2 active usersReviewed
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Distributionally Robust Stochastic Optimization with Wasserstein Distance: If the Growth Rate κ of Ψ Is Finite, sup{E_μ[Ψ] : W_p(μ, ν) ≤ θ} Equals Its One-Dimensional Dual and Is FiniteResearch Paper

Distributionally robust stochastic optimization (DRSO) chooses a decision xxx to minimize the worst expected loss sup⁡μ∈MEμ[Ψ(x,ξ)]\sup_{\mu\in\mathfrak M}\mathbb E_\mu[\Psi(x,\xi)]supμ∈M​Eμ​[Ψ(x,ξ)] over an ambiguity set M\mathfrak MM of probability distributions, instead of the expectation under one estimated distribution. When M\mathfrak MM is a ball around a nominal distribution ν\nuν (often the…

16 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Trade Credit, Risk Sharing, and Inventory Financing Portfolios: The Optimal Contract Always Uses Trade Credit, with Net Terms for Costless Default or High Cash and Two-Part Terms for Low CashResearch Paper

Most business-to-business sales are not paid in cash on delivery. The supplier lets the buyer pay later, which is trade credit, and often offers a discount for paying early. In the classic "2/10 net 30" the buyer gets 2% off for paying within 10 days and otherwise owes the full price in 30 days. Trade credit is a major source of short-term finance for…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Multistage Adaptive Robust Optimization for the Unit Commitment Problem I: Without Ramping Constraints, Two-Stage and Multistage Robust Unit Commitment Are EquivalentResearch Paper

Unit commitment (UC) is the day-ahead decision of an electricity system operator: which generators to switch on in each hour of the next day, and how much each of them should produce. System operators solve UC problems every day, and their cost and reliability are first-order concerns of power-system operations. With a large share of wind and solar…

10 thms2 active usersReviewed
PreviousPage 86 of 107Next

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