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
Bandit AlgorithmsMachine LearningProbability+1·Captain: mikedeng1

The Fragility of Optimized Bandit Algorithms: Optimized Bandit Algorithms Have Truncated Cauchy Regret TailsResearch Paper

The stochastic multi-armed bandit is the basic model of sequential decision-making under uncertainty: in each round an algorithm chooses one of KKK arms, observes a random reward from that arm's distribution, and tries to play the best arm as often as possible. Since Lai and Robbins (1985) the standard of quality has been the expected regret, and an algorithm…

14 thms3 active usersReviewed
CombinatoricsLinear OptimizationOptimization+1·Captain: mikedeng1

Improved Guarantees for the A Priori TSP: Random Sampling with Probability 1 − (1 − p)^0.663 and a 3/2-Approximate Master Tour Has Approximation Guarantee Below 3.1 on Instances with a DepotResearch Paper

In the a priori traveling salesman problem with independent activation, a tour through all customers must be fixed before it is known which customers need a visit; each customer is active independently with a known probability, and the fixed tour is afterwards cut short to the active ones. The model, introduced by Jaillet and by Bertsimas as the…

19 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationOptimization·Captain: mikedeng1

Revenue Management with Repeated Customer Interactions: the myopic policy earns at least a (1 − γ) fraction of the optimal revenue under bang-per-buck heterogeneity γResearch Paper

Network revenue management studies how a platform with limited supply should allocate products to customers at given prices. Most of the literature treats each interaction as one-shot: a request arrives, is served or rejected, and leaves. Examples are the fluid models of Gallego and van Ryzin (1997) and the bid-price controls of Talluri and van Ryzin (1998).…

13 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Distribution-Free Pricing: Knowing Only the Mean and Variance, the Price μ − k*σ Is Maximin-Optimal and Earns a Fraction ρ of the Optimal ProfitResearch Paper

A seller who posts a single price ppp for a product with marginal cost ccc earns (p−c)(p-c)(p−c) from every customer whose valuation is at least ppp. Choosing ppp well requires the distribution of valuations, which in practice is rarely known: a new product, a new market, or a short sales history typically yields an estimate of the mean and the spread of willingness to pay,…

10 thms3 active usersReviewed
🏆Completed
Experimental DesignOptimizationStatistics·Captain: mikedeng1

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization: The Optimal Independent Block Randomization Experiment Is Asymptotically Optimal at Rate O(√(w₁²/Σwᵢ²))Research Paper

Online platforms run randomized experiments on users who interact with each other. When the treatment of one user affects the outcome of another, comparing treated and control users is biased. A standard remedy is cluster-based randomization: users are grouped into clusters with few edges between them, and whole clusters are assigned to treatment or control…

11 thms3 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Pricing with Samples: Posting 0.76 Times a Single Sample Earns at Least 64% of the Optimal Revenue Against Every Monotone Hazard Rate DistributionResearch Paper

A seller who knows the distribution FFF of a buyer's value can post the revenue-maximizing price. In practice the seller rarely knows FFF; often it has only a handful of past observations. Pricing with samples asks how much revenue such data can guarantee: the seller sees NNN independent draws from FFF, posts a price that depends on them, and is judged by the…

7 thms3 active usersReviewed
🏆Completed
EconomicsMechanism Design·Captain: mikedeng1

Optimal Monopoly Mechanisms with Demand Uncertainty: When All Consumers Find the Low-Demand State More Likely, State-by-State Monopoly Pricing Is an Optimal BIC and EIR MechanismResearch Paper

A monopolist selling to a large market of unit-demand consumers with a known demand curve cannot do better than posting a single price (Myerson 1981; Bulow and Roberts 1989). When the demand curve itself is uncertain, consumers' valuations are correlated through the aggregate state, and the picture changes. Crémer and McLean (1985, 1988) showed that with…

10 thms3 active usersReviewed
🏆Completed
EconomicsMechanism Design·Captain: mikedeng1

Information Nudges and Self-Control: An Optimal Incentive-Compatible Information Nudge Is a Cutoff MechanismResearch Paper

Warnings about health, financial or environmental risks are among the most common policy instruments: cigarette packs carry risk statements, doctors tell patients which risk group they belong to, and retirement planners report survival probabilities. Standard decision theory says that more accurate information can only help a decision maker. That conclusion…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

The Cost of Nonconvexity in Deterministic Nonsmooth Optimization: Deterministic Bisection Finds a Small Goldstein Subgradient Within an Oracle-Call Budget Set by the Nonconvexity ModulusResearch Paper

Minimizing a nonsmooth, nonconvex Lipschitz function is intractable in general, so nonsmooth optimization asks for a weaker certificate: a point near which a small convex combination of nearby subgradients exists. Such a vector is a Goldstein subgradient, a notion going back to Goldstein in the 1970s. Zhang, Lin, Jegelka, Sra and Jadbabaie (2020) gave the…

12 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Lagrangian Inference for Ranking Problems: Asymptotic Normality of the Lagrangian Debiased EstimatorResearch Paper

Ranking from pairwise comparisons is used in sports ratings, recommendation systems, crowdsourcing and web search. The most widely used parametric model is the Bradley–Terry–Luce (BTL) model (Bradley and Terry 1952; Luce 1959), in which item kkk carries a score θk\theta_kθk​ and item iii beats item jjj with probability eθi/(eθi+eθj)e^{\theta_i}/(e^{\theta_i}+e^{\theta_j})eθi​/(eθi​+eθj​). The…

7 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Monte Carlo Estimation of CoVaR: Asymptotic Normality and the n^(-1/3) Rate of the Batching EstimatorResearch Paper

CoVaR is the measure of systemic risk proposed by Adrian and Brunnermeier (AER 2016): the β-quantile of one institution's loss YYY given that another loss XXX (a bank, a market index) sits exactly at its own α-quantile, its value-at-risk. Regulators and risk managers compute it from simulation models of portfolios, where the joint law of (X,Y)(X, Y)(X,Y) is available…

13 thms3 active usersReviewed
CombinatoricsLinear Optimization·Captain: mikedeng1

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra: Min-Max Theorem for Separable Discrete Convex Functions over Integral Points of a Box-TDI PolyhedronResearch Paper

Minimizing a separable convex function over the integral points of a polyhedron is a recurring problem in combinatorial optimization: resource allocation, minimum-cost flows with convex costs, and the "fair" or "decreasingly minimal" integral elements studied by Frank and Murota all have this form. When the polyhedron is described by a totally unimodular…

17 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

New Constructions of Obviously Strategyproof Mechanisms: No OSP Mechanism for Scheduling Identical Jobs on Related Machines with Three-Value Domains Is Better Than √n-ApproximateResearch Paper

A mechanism is strategyproof when truth-telling is a dominant strategy for every agent. Experimental and theoretical work has found that this guarantee is fragile in practice: agents faced with a sealed-bid second-price auction often misreport, while the same agents bid truthfully in the strategically equivalent ascending clock auction. Li (Obviously…

6 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Optimal Prototyping with Noisy Measurements: A Fidelity-Adjusted Reservation Price Policy Is Optimal for Sequential Search with Noisy EvaluationsResearch Paper

Product development is often organized as a search over prototypes: several candidate designs exist, each must be built or tested at a cost before its quality is known, and the firm wants to end up launching the best one without spending too much on testing. When each test reveals the true quality of a prototype, this is Pandora's box problem, solved by…

7 thms3 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Sales-Based Rebate Design: No Increasing Sales-Based Reward Program Is ProfitableResearch Paper

Products with positive network effects (messaging apps, online games, social platforms) are known to support higher profits: a buyer's utility grows with the number of other buyers, and a seller can monetize that complementarity (Katz and Shapiro 1986; Candogan, Bimpikis and Ozdaglar 2012). Ajorlou and Jadbabaie ask whether a seller of a product without such…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignProbability·Captain: mikedeng1

Incentive-Compatible Forecasting Competitions: the Independent-Event Lotteries mechanism is strictly incentive compatible under belief independence and limit accurate for independent eventsResearch Paper

Forecasting competitions ask many forecasters to report probabilities for many future binary events and award a single prize to one of them. They are used to identify and reward accurate forecasters: the Good Judgment Project gave "superforecaster" status to the top 2% by quadratic score, and data-science platforms run similar leaderboards. The usual rule…

14 thms3 active usersReviewed
🏆Completed
Control TheoryDynamic Programming·Captain: mikedeng1

Driving Supply to Marketplaces: Optimal Platform Pricing When Suppliers Share Inventory: The Supplier Shares Its n-th Unit Exactly When the Time-to-Go Is at Most a Threshold tₙResearch Paper

Online marketplaces such as Zalando, Amazon or Farfetch let brands sell through the platform's storefront in addition to their own stores. One common arrangement is inventory sharing: the brand keeps ownership of its stock, but makes it visible to the platform's customers, and pays the platform a commission on every unit the platform sells. For a supplier…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationDiscrete Geometry·Captain: mikedeng1

Mixed-Integer Convex Representability: Closed Rational MICP-Representable Sets Whose Convex Subsets Have Bounded Diameter Are Finite Unions of Compact Convex and Closed Periodic SetsResearch Paper

Mixed-integer convex programming (MICP) optimizes over sets described by convex constraints together with the requirement that some variables be integers. Modern solvers handle such problems routinely, so a modeler who wants to optimize over a nonconvex set S⊆RnS \subseteq \mathbb R^nS⊆Rn asks a basic question first: can SSS be written as the projection of the…

29 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Portfolio Optimization Based on Almost Second-Degree Stochastic Dominance: Approximate ASSD Under a Discretization Scheme Implies ASSDResearch Paper

Second-order stochastic dominance (SSD) is the standard ordering of risky prospects for risk-averse investors: a return XXX dominates a return YYY by SSD when every investor with a nondecreasing concave utility weakly prefers XXX. Portfolio models that require a chosen portfolio to dominate a benchmark by SSD go back to Dentcheva and Ruszczyński (2003) and are…

8 thms3 active usersReviewed
🏆Completed
EconomicsProbability·Captain: mikedeng1

Can a Supplier’s Yield Risk Be Truthfully Communicated via Cheap Talk?: Truthful Yield Reporting Is an Equilibrium Iff Expected Market Potentials Bracket the Adjusted Wholesale RateResearch Paper

A firm that outsources a new product or component to a supplier with an immature production process faces random yield: only a random fraction of the input becomes a usable unit. In semiconductor manufacturing, for instance, yield losses on new-generation chips have been reported at 30–45%. The supplier usually knows her own yield better than the buyer…

8 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Cross-Category Retailing Management: Substitution and Complementarity: Optimal Cross-Selling Prices Equalize Aggregate Markups, and the Optimal Profit Is the Unique Fixed Point of HResearch Paper

Retailers often sell products from two categories that are bought one after the other: a television and then a speaker, a laptop and then a mouse, a suit and then a tie. The first purchase changes how much the second is worth to the consumer, which is called a complementarity effect, and online stores act on it by showing secondary products only after a…

6 thms3 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Stochastic Optimization Forests: the approximate risk criterion consistently approximates the oracle splitting criterion as the region to split shrinksResearch Paper

In contextual stochastic optimization a decision z∈Rdz\in\mathbb R^dz∈Rd is chosen after observing features X∈RpX\in\mathbb R^pX∈Rp, and the ideal policy solves, for each feature value,

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

“Sherlocking” and Platform Information Policy: The Full-Commitment Outcome Is Implementable by an Information Policy If and Only If the No-Entry Obedience Constraint (OC0) HoldsResearch Paper

Large online marketplaces are hybrid platforms: they host third-party sellers and also sell their own products. Running the marketplace gives the platform access to sellers' sales data, and it can use that data to identify successful products and launch imitations of its own. The practice is colloquially called "Sherlocking". It has drawn regulatory…

8 thms3 active usersReviewed
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper

Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Tracking Truth with Liquid Democracy: Upward Delegation Satisfies Probabilistic Do No Harm and Positive GainResearch Paper

Liquid democracy lets each voter either vote directly or delegate the vote to another voter, who may delegate it further. It has been used in practice, for example by the German Pirate Party on the LiquidFeedback platform and in the Google Votes experiment, and has been studied in computational social choice as a way to give more weight to better-informed…

13 thms3 active usersReviewed
PreviousPage 42 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