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
Convex OptimizationProbability·Captain: Shuze Chen

Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning: Exact convex reformulation of worst-case riskResearch Paper

A nominal probability distribution describes the uncertainty available to a decision maker, but it need not equal the distribution that will generate future observations. Wasserstein distributionally robust optimization evaluates a loss against every probability law within a prescribed transport distance of the nominal law. The resulting worst-case risk is…

18 thms5 active usersReviewed
🏆Completed
Bandit Algorithms·Captain: Shuze Chen

Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality: Exponential convergence of locally affine policiesResearch Paper

A decision maker often manages many similar systems while being able to intervene in only a fraction of them at once. Each system changes over time even when it receives no intervention. A restless bandit describes this situation by treating each system as an arm with its own state and two available actions. The finite-horizon problem is to coordinate those…

13 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

Learning Product Rankings Robust to Fake Users: With the Fakeness Budget F Unknown, FORC Has Regret O((n²F + log T) Σ_{j<i} log(nT)/Δ_{j,i})Research Paper

Online platforms rank products, and the ranking is learned from clicks. Click farms and bots exploit this: fake users click on a product so that the platform promotes it. Golrezaei, Manshadi, Schneider and Sekar (arXiv:2009.05138, Operations Research 71(4), 2023) study how to learn a ranking when an unknown number of users are fake and cannot be told apart…

22 thms5 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

AI Agents for Inventory Control: Human-LLM-OR Complementarity: P[CE > δ] ≥ sup_t (F_a(t) − F_b(t + δ)) for Every Joint Law of (a, b), with Equality for Some CouplingResearch Paper

Large language models are now deployed as decision aids next to human decision-makers, and a basic empirical question is whether the pair does better than either party alone. Baek, Fu, Ma and Peng (arXiv:2602.12631v2) study this question for inventory control: they build a benchmark of multi-period inventory problems, compare operations-research policies,…

15 thms5 active usersReviewed
🏆Completed
CombinatoricsMachine LearningOptimization·Captain: mikedeng1

The Power of Subsampling in Submodular Maximization: SampleGreedy is a (p+1)²/p-approximation for non-negative submodular maximization over p-extendible systemsResearch Paper

Many selection problems in machine learning and operations research ask for a set of items that maximizes a utility with diminishing returns, subject to a combinatorial feasibility constraint: summarizing a collection of images or documents, placing sensors, recommending a diverse set of products, or choosing a set of edges that forms a matching.…

19 thms5 active users
🏆Completed
Actuarial ScienceOptimal TransportProbability·Captain: mikedeng1

Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions: Strong Duality for the Worst-Case Spectral Risk Measure over CouplingsResearch Paper

A portfolio loss often depends on several risk factors whose individual distributions can be estimated well but whose joint distribution cannot. Regulators and risk managers then ask for the worst-case risk: the largest value a risk measure can take over all joint laws compatible with the known marginals. For Value-at-Risk and Expected Shortfall of sums…

15 thms5 active usersReviewed
🏆Completed
Control TheoryReinforcement LearningStochastic Systems·Captain: mikedeng1

Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability: Finite-Window Q-Learning Converges Almost Surely, with a Filter-Stability Loss BoundResearch Paper

A partially observed Markov decision process (POMDP) is a controlled Markov chain whose state the controller never sees. Only noisy observations are available. Such models describe sensor-based control, maintenance under imperfect inspection, and most reinforcement-learning tasks in which the agent sees an image or a measurement rather than the system's…

14 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebra·Captain: mikedeng1

Equilibria and Systemic Risk in Saturated Networks: necessary and sufficient conditions for uniqueness of saturated network equilibria, class by class, when the spectral radius is at most oneResearch Paper

Many models of contagion in networks reduce to the same fixed-point equation: each node receives a linear combination of the states of its in-neighbours plus an exogenous term, and its own state is that inflow clipped to an interval. In the interbank clearing model of Eisenberg and Noe (Management Science, 2001) the states are payments capped by…

17 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models: The Adaptive-Confidence Trisection Policy Has N-Independent Regret at Most C√TResearch Paper

A retailer that sells NNN substitutable products must decide, for each arriving customer, which subset of products to display. Customer preferences are unknown at the start and have to be learned from purchases, while every suboptimal display costs revenue. This is dynamic assortment planning, a standard problem of revenue management in e-commerce and online…

17 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningStatistics·Captain: mikedeng1

Mostly Exploration-Free Algorithms for Contextual Bandits: the greedy algorithm has logarithmic regret for two-armed linear contextual bandits under covariate diversityResearch Paper

In a contextual bandit, a decision maker repeatedly observes the features of an individual (a patient, a customer, a user), chooses one of several actions, and sees the reward of the chosen action only. Applications include personalized medicine, dynamic pricing and ad placement. The standard algorithms (upper-confidence-bound and Thompson-sampling methods,…

11 thms5 active usersReviewed
🏆Completed
Complexity TheoryProbability·Captain: mikedeng1

Bayesian Decision Making in Groups is Hard: In the Vertex-Cover Reduction, Small and Large Covers Force Opposite Exponentially Concentrated Beliefs at Time TwoResearch Paper

Models of Bayesian social learning describe agents in a network who each receive a private signal about an unknown state of the world, observe the actions of their neighbours over time, and act optimally given everything they have seen. They are used in economics, operations research and the study of collective decision making to ask whether groups…

13 thms5 active usersReviewed
🏆Completed
OptimizationProbabilityStatistics·Captain: Shuze Chen

Modeling, Measuring and Managing Risk I: Characterizations of Stochastic DominanceTextbook

A decision maker who must choose between two uncertain profits Y(1)Y^{(1)}Y(1) and Y(2)Y^{(2)}Y(2) rarely knows their own utility function precisely. Stochastic dominance replaces a single utility by a whole class of them: Y(2)Y^{(2)}Y(2) is preferred if every utility in the class prefers it. The resulting partial orders are the basic consistency requirement for risk and…

11 thms5 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: Shuze Chen

Stochastic Networks IX: Time Reversal on Countable State SpacesTextbook

Queueing models describe systems that repeatedly change state: a customer arrives, a service completes, or a circuit becomes free. Their long-run behaviour depends both on how frequently states are visited and on how long each visit lasts. Looking at an equilibrium trajectory backwards produces another process, whose transitions can expose relationships…

6 thms5 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOptimization·Captain: mikedeng1

Intersection Disjunctions for Reverse Convex Sets: The Basis Cone Outside the Recession-Cone Inner Approximation of the Convex Set Is a Union of |N2| + 1 Disjunctive TermsResearch Paper

A reverse convex set is the part of a polyhedron that lies outside an open convex set: P∖CP\setminus CP∖C, where P={x∈R+n:Ax=b}P=\{x\in\mathbb{R}^n_+ : Ax=b\}P={x∈R+n​:Ax=b} and C⊆RnC\subseteq\mathbb{R}^nC⊆Rn is open and convex. Such sets arise whenever a model forbids a convex region: integrality (a lattice-free convex set contains no feasible point in its interior), bilevel programs, where the…

9 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingEconomicsMarkov Chain·Captain: mikedeng1

An Analysis of “Buy X, Get One Free” Reward Programs: Without Transaction Utility, a Redemption Threshold Alone Cannot Raise the Firm's Long-Run Profit Above max{λqv, λ(v − v̄)}Research Paper

"Buy XXX, get one free" (BXGO) programs are among the most common loyalty schemes: coffee shops, car washes, golf courses and hotel chains hand out a free unit after a fixed number of paid purchases. A long empirical literature documents that such programs change behaviour, most visibly through point pressure, the acceleration of purchases as a customer…

19 thms5 active usersReviewed
🏆Completed
EconomicsOptimization·Captain: mikedeng1

A Model of Product Line Marketing: When the Transformed Marketing Cost Is Concave, the Optimal Marketing Effort Allocation Concentrates on a Single Flagship ProductResearch Paper

Firms with several products often put most of their marketing behind one. The resulting product can become the line's flagship even when another product has a higher unit markup. He, Ke, and Zhang give a supply-side model in which this allocation follows from the relation between consumer taste dispersion and the cost of raising a product's perceived…

11 thms5 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs: Limiting and Horizon Subdifferentials of the Maximal Value Function via Wolfe DualityResearch Paper

Value functions of parametric optimization problems appear wherever one optimization problem sits inside another. In a minimax program min⁡xmax⁡yf(x,y)\min_x \max_y f(x,y)minx​maxy​f(x,y) the outer problem minimizes the maximal value function V(x)=max⁡yf(x,y)V(x)=\max_y f(x,y)V(x)=maxy​f(x,y); in bilevel programming and in the value-function approach to equilibrium problems the same object enters as a constraint.…

11 thms5 active usersReviewed
🏆Completed
Computational GeometryOptimization·Captain: mikedeng1

Demand Equilibria in Spatial Service Systems: At Locally Optimal Service Rates the Decentralized Demand Equilibrium Coincides with the Socially Optimal PartitionResearch Paper

Public and healthcare services — driver's licence offices, emergency rooms, testing sites — are spread over a region, and customers choose for themselves which facility to visit. A customer weighs two costs: the travel distance to a facility and the expected wait once there. The wait depends on how many other customers chose the same facility. The resulting…

12 thms5 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: Shuze Chen

Flows in Networks IV: Unicursal Mixed GraphsTextbook

Graph theory began with a unicursal problem: Euler's question whether the bridges of Königsberg can be crossed in one closed walk using each bridge exactly once. For graphs whose arcs are all undirected, or all directed, the answer has been known since the nineteenth century: a connected graph has such a closed walk exactly when every node has even degree,…

9 thms5 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

A Theory of Assurance: Balancing Costly Formal Control with Tone at the Top: The Authority's Optimal Formal Control and the High-Type CEO's Tipping Point in the Diversion ModelResearch Paper

Boards and audit committees use formal controls to limit the resources that an executive can divert. Controls can also change the executive's decision: a CEO who values her future reputation may comply when the remaining opportunity to divert is too small. Penno's diversion model puts these two effects in one decision problem. It asks how much costly…

9 thms5 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Managing Opportunistic Consumer Returns in Retail Operations: A Menu of Refunds Earns the Targeted-Refunds Profit if and only if the Optimal Uniform Refund Is at Least the Salvage ValueResearch Paper

Generous return policies raise demand, but they also invite opportunistic returns: customers who buy a product intending to use it briefly and return it for a refund. Retail-industry surveys put the share of such "wardrobing" or renting customers near a tenth of all customers, and retailers answer with restocking fees, return windows, or analytics services…

14 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

Selfishness Need Not Be Bad: In Every Nonatomic Congestion Game with Regularly Varying Cost Functions the Price of Anarchy Tends to 1 Along Every Unbounded Demand SequenceResearch Paper

The price of anarchy (PoA) measures how much selfish routing costs compared with a coordinated optimum: it is the ratio of the cost of a Wardrop equilibrium to the minimum social cost. Worst-case bounds on this ratio are classical (Roughgarden and Tardos, JACM 2002; Correa, Schulz and Stier-Moses, Math. Oper. Res. 2004), and for polynomial costs of degree …

17 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Incentives and Gaming in Collaborative Projects Under Risk-Sharing Partnerships: Exact Conditions Under Which Information Asymmetry Shortens the Project with Time-Dependent Delay PenaltiesResearch Paper

Collaborative projects often assign different tasks to different firms while making each firm bear part of the cost of a late project. A supplier's decision to spend more time on its task can therefore impose delay costs on a manufacturer, and the manufacturer's own schedule can impose costs on the supplier. The incentives differ from those of one firm…

14 thms5 active users
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Regularized Aggregation of One-Off Probability Predictions: The Jeffreys-Type Priors π(θ; a, b) Give a Proper Posterior When the Probit Predictions Disagree and Their Mean Is Not μ0Research Paper

A decision maker who asks several experts for the probability of a one-off event (an election result, a geopolitical outcome, a product launch) has to turn KKK reported probabilities into one. Simple averages are known to be under-confident when the experts hold different information, and over-confident when they share noise. Model-based aggregators correct…

12 thms5 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Dynamic Probabilistic Selling When Customers Have Boundedly Rational Expectations: The Optimal Two-Period Pricing and Product-Offering Policy When Each Customer Draws One AnecdoteResearch Paper

Probabilistic selling, also called opaque selling, offers a customer a product whose exact version is revealed only after purchase: a "mystery box", an unnamed hotel on a travel site, a flight whose carrier is announced after booking. The firm controls the price and the probability with which each version is delivered. The classical analyses (Fay and Xie…

19 thms5 active users
PreviousPage 5 of 106Next

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