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

Open971Completed2643All3614
🏆Completed
Algorithmic Game TheoryLinear Optimization·Captain: mikedeng1

Linear Program-Based Approximation for Personalized Reserve Prices: Rounding the Profile LP Earns a (1 + 2(√2 − 1)e^(√2 − 2))⁻¹ ≈ 0.684 Fraction of the Optimal Eager Second-Price RevenueResearch Paper

Online advertising exchanges sell most impressions through second-price auctions with reserve prices. A seller who has logged the bids of many past auctions wants reserves that would have earned the most revenue on that history. When the bids are drawn i.i.d. from a distribution, the revenue-optimal reserves on a large sample approximate the revenue-optimal…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryGraph Theory·Captain: mikedeng1

The Buck-Passing Game: Every Deterministic Buck-Passing Game Has a Prior-Free Pure Nash EquilibriumResearch Paper

In a buck-passing game, each participant chooses who will receive a task, burden, or token next. The eventual share of time spent holding it depends on every participant's choice. This makes a small network into a game: a local change of one outgoing edge can alter the long-run burden across an entire part of the network. Cominetti, Quattropani, and…

9 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Bounding Residence Times for Atomic Dynamic Routings: If No Later Entrant Leaves the Subnetwork First, an Agent Exits by Time r0 plus the Longest Path Length plus the Earlier Agents Still InsideResearch Paper

In atomic dynamic routing, indivisible agents (vehicles, packets, travellers) enter a network over time and travel along fixed routes. Each road admits a limited number of agents per unit of time, so agents queue at its entrance. A basic question for traffic models, packet-switching networks and dynamic routing games is how long an agent can stay in the…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

Procurement Mechanisms with Post-Auction Pre-Award Cost-Reduction Investigations: Symmetric Suppliers Earn Weakly Higher Ex Ante Profits When Investigations Precede the AwardResearch Paper

Large manufacturers procure components by competitive bidding, and many of them also run cost-reduction investigations: the buyer's engineers visit a supplier's plant and look for process changes that lower the cost of the contracted part. The savings are passed to the buyer as a lower contract price. In practice such investigations usually happen after the…

8 thms2 active usersReviewed
🏆Completed
EconomicsOptimization·Captain: mikedeng1

Labor Welfare in On-Demand Service Platforms: With Delay-Sensitive Customers, Average Labor Welfare First Increases and Then Decreases in the Labor Pool SizeResearch Paper

On-demand service platforms (ride-hailing, delivery, home services) do not employ their workers. They set a price for customers and a wage per unit of work, and independent agents decide how much time to make themselves available. A recurring policy question, raised by regulators and labor advocates alike, is whether platforms should be allowed to recruit…

15 thms2 active usersReviewed
🏆Completed
Linear algebra·Captain: mikedeng1

Controlling Epidemic Spread: Reducing Economic Losses with Targeted Closures: The Effective Reproduction Rate Is Below One if and only if a Linear Matrix Inequality in the Activity Levels HoldsResearch Paper

A city can reduce contacts by limiting activity in selected neighborhoods. Such a policy affects more than the residents of the closed neighborhood: people travel across neighborhood boundaries, meet there, and carry infection back to their home neighborhoods. A citywide closure ignores these differences in movement and economic cost. Birge, Candogan, and…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Revenue-Sharing Allocation Strategies for Two-Sided Media Platforms: Pro-Rata vs. User-Centric: The Ratios π2j/π1j for Which Each Rule Sustains All Artists Form Two Explicit IntervalsResearch Paper

Music and podcast streaming services such as Spotify, Apple Music and Deezer charge every subscriber the same monthly fee and pass a share of the collected revenue to the artists. How that share is split is contested. The industry default, pro-rata, pools all fees and pays each artist her share of total streams. The alternative, user-centric, splits each…

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

A Primal-Dual Smoothing Framework for Max-Structured Non-Convex Optimization: The Framework Returns an ε-Near-Stationary Point Within an Explicit Number of IterationsResearch Paper

Many problems in robust optimization, adversarial learning, distributionally robust learning and min-max games have the max-structured form

10 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Brand Spillover as a Marketing Strategy: The Weak-Brand Firm Should Commit to Forgo Brand Spillover if and only if the Supplier Would Otherwise Drop It or the Insourcing Cost Is LowResearch Paper

Competing brands often buy their products from the same contract manufacturer (CM). A weaker brand can exploit this. The paper's opening example is the Chinese retailer Netease Yanxuan, which advertises that its goods use "the same materials, the same factories, and the same workers" as international brands such as Adidas, Coach and MUJI. A weak brand that…

11 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

On Co-opetitive Supply Partnerships with End-Product Rivals: Information Asymmetry, Dual Sourcing and Supply Market Efficiency: The Equilibrium Wholesale Price and When the VI Buys InformationResearch Paper

Firms often buy key components from the very rivals they compete with in the end market. The paper's examples: Lockheed Martin has sourced engine control systems and gearboxes from AgustaWestland, its competitor in national helicopter markets, while avoiding single sourcing from it in markets where it holds an information advantage; vertically integrated…

10 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

Quality Regulation on Two-Sided Platforms: Exclusion, Subsidization, and First-Party Applications: Exclusion Is a Special Case of Subsidization and Is Dominated by ItResearch Paper

An application platform can increase average quality by excluding low-quality developers, or it can pay high-quality developers to join. Either choice changes the number of applications, the consumer audience, and the fees the platform can charge. Huang, Lyu, and Xu study these linked effects in a two-sided market with consumers and two developer types.…

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

On the Futility of Dynamics in Robust Mechanism Design: Minimax Regret Equals T Times the Single-Round Minimax Regret and Repeating a Direct Static Mechanism Is OptimalResearch Paper

A seller who faces the same buyer again and again, a firm that contracts repeatedly with a supplier, or a platform that allocates resources to a returning user can adapt its terms over time. The buyer's behaviour reveals information about their preferences, and mechanisms can link rounds through bundles, discounts and promised future utility. When the…

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

Preference Elicitation for Participatory Budgeting: Randomized Threshold Approval Votes Achieve Distortion O(log² m)Research Paper

In participatory budgeting, residents of a city vote on how to spend part of a public budget on a list of proposed projects, each with a known cost. The practice has been adopted by cities in North America and Europe, including New York City, Chicago, Madrid and Paris, the last two each spending more than 100 million euros through participatory budgets in…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatorics·Captain: mikedeng1

Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation: Recursive Probabilistic Serial Is Ex-Ante Envy-Free and Ex-Post Envy-Free up to One GoodResearch Paper

Many allocation problems hand out indivisible goods without money: course seats, shifts, donated food, inherited items. An integral allocation of such goods can rarely be envy-free. With one good and two agents, someone always envies. The standard remedies are of two kinds. Randomization restores fairness in expectation: the probabilistic serial rule of…

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

Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs: An Upper Bound on the Long-Run Average Cost of Modified Echelon (r,Q) PoliciesResearch Paper

A one-warehouse, multi-retailer (OWMR) distribution system is the basic model of a supply chain in which a central warehouse buys from an outside supplier and ships to several retail locations. When every shipment carries a fixed cost and a positive lead time, the optimal policy of the stochastic system is unknown, and the classical approach is to search…

7 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Optimal Sequential Multi-class Diagnosis: Under Exponential Tilting, Every Reachable Posterior Belief Is a Closed-Form Function of an r-Dimensional Diagnostic Statistic, r = rank(B)Research Paper

In sequential multi-class diagnosis, a decision maker observes a system repeatedly, then chooses when to stop and which hidden class to report. Each new observation can improve the diagnosis, but waiting has a cost. A direct dynamic program uses the vector of posterior class probabilities as its state. With N+1N+1N+1 possible classes, that state lies in an NNN-dimen…

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

Exploiting Random Lead Times for Significant Inventory Cost Savings: With Exponential Lead Times, the Generalized Base-Stock Policy's Scaled Stationary Inventory Level Converges to N(0, 1/(βγ))Research Paper

In continuous-review inventory systems with backlogging, the classical constant base-stock (CBS) policy orders one unit whenever one unit of demand arrives, so that the inventory position (net inventory plus in-transit inventory) stays constant. Under CBS with Poisson demand of rate rrr and i.i.d. lead times with mean 1/β1/\beta1/β, the in-transit inventory has a…

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

Implications of Price Matching in Supply Chain Negotiation: Under Symmetric Bargaining Power the Seller Prefers Price Matching to Simultaneous Negotiation and Both Buyers Prefer the ReverseResearch Paper

A seller that supplies several competing buyers may negotiate a wholesale price with each of them independently and simultaneously (simultaneous negotiation, SN), or may commit to charge all of them the same price (price-matching negotiation, PM). PM is the bargaining counterpart of the most-favoured-customer clause, a contractual guarantee that a customer…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryTheoretical Computer Science·Captain: mikedeng1

Dynamic Fair Resource Division: The Optimal Fairness Ratio of d-Uniform Control Vectors Is 1/((d+1)·ln((d+1)/d)), Attained by the Frugally Fair AlgorithmResearch Paper

Shared computing infrastructure — a data-centre cluster, a cloud platform's memory — is divided among users who arrive over time. Two requirements pull against each other. Proportional fairness asks that, when ttt users are present, each holds at least a 1/t1/t1/t fraction of the resource. Limited disruption asks that the system not take resource away from running…

9 thms2 active usersReviewed
🏆Completed
EconomicsProbability·Captain: mikedeng1

Costly Interpretation of Asset Prices: With Costly Price Interpretation There Is a Unique Linear Financial Market Equilibrium, and Its Price Carries Endogenous NoiseResearch Paper

A central question of financial economics is how much of the information dispersed among traders ends up in market prices. The workhorse model is the noisy rational expectations equilibrium (REE): investors with private signals trade a risky asset, the price aggregates their information, and each investor learns from the price as well as from her own signal…

9 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Stochastic Knapsack Revisited: The Service Level Perspective: Anticipative Policies Need at Most 2Δ More Capacity Than Adaptive Policies to Meet Type-I Service LevelsResearch Paper

A central planner holds a single pool of QQQ units of a product and must supply NNN customers whose demands d~1,…,d~N\tilde d_1, \dots, \tilde d_Nd~1​,…,d~N​ are random. Each customer iii asks to be fully served, i.e. to receive her entire demand, with probability at least a target αi\alpha_iαi​. This Type-I service level (the persistency value of the stochastic knapsack) is the standard…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOptimization·Captain: mikedeng1

Risk Guarantees for End-to-End Prediction and Optimization Processes: The Excess Squared-Loss Risk Bounds the Squared Excess Optimality-Gap Risk, Scaled by the Squared Diameter of the Feasible SetResearch Paper

Many operational decisions are optimization problems whose cost vector is unknown when the decision is made but can be predicted from observed features: shortest paths under predicted travel times, portfolios under predicted returns, production plans under predicted prices. The common practice, predict-then-optimize, first fits a regression model ggg mapping…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time: A Maximal Minimum k-Partition's First Part Is the Source-Maximal Minimum (S, T)-Terminal Cut for Some |S| = 2k − 2Research Paper

The hypergraph k-cut problem asks for a least-cost way to split the vertices of a hypergraph into kkk nonempty groups. An edge of a hypergraph may contain more than two vertices, so the graph version does not capture the behavior of every input. For fixed kkk, randomized polynomial-time algorithms for hypergraph k-cut were known before the deterministic result…

15 thms2 active usersReviewed
🏆Completed
EconomicsMechanism Design·Captain: mikedeng1

Mechanism Design for Managing Hidden Rebates and Inflated Quotes of a Procurement Service Provider: Paying a Fee Equal to the Hidden Rebate Is the Optimal Truthful Contract for Small RebatesResearch Paper

Retailers that source apparel and other consumer goods from contract manufacturers in developing countries often work through a procurement service provider, an intermediary that solicits quotes, negotiates and manages production on the retailer's behalf. A documented problem in this industry is the hidden rebate: some manufacturers pay the intermediary a…

5 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Optimal Price/Advertising Menus for Two-Sided Media Platforms: In Duopoly with Multi-Item Menus the Unique Equilibrium Is a Symmetric Two-Item Menu on Which Both Consumer Types Multi-HomeResearch Paper

Ad-supported media and digital services (streaming music and video, news sites, social platforms) sell to two sides at once. Consumers value the content, advertisers value the consumers' attention, and consumers usually regard advertising as a nuisance whose cost differs from one person to the next. Many such platforms answer this with menu pricing: a free…

12 thms2 active usersReviewed
PreviousPage 77 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