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

Supply Chain Inventory Management and the Value of Shared Information: A lower bound on costs under every feasible policyResearch Paper

A supplier receiving orders from several retailers sees only part of the demand that drives the supply chain. Access to the retailers' inventory and demand histories can change when the supplier orders and where it sends available stock. A comparison between two selected policies, however, does not establish how much an unknown better policy could save. A po…

9 thms3 active usersReviewed
🏆Completed
Optimization·Captain: Shuze Chen

A Nonparametric Algorithm for Optimal Stopping Based on Robust Optimization: Existence and finite characterization of optimal robust stopping rulesResearch Paper

An exercise decision can depend on today's observed state even when the evolution of that state depends on its history. Examples include deciding when to exercise an option whose reward depends on several asset prices or on earlier observations. A simulator can produce complete trajectories without providing the conditional distributions needed for a…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs: ALSO-X is at least as good as CVaRResearch Paper

A chance constrained program chooses a decision before observing uncertainty and limits the probability that its constraints fail. For example, a service system can allow a prescribed fraction of demand realizations to exceed its available capacity. The optimization problem combines a cost objective with a probability requirement. Even when each realized…

8 thms3 active usersReviewed
🏆Completed
Optimization·Captain: Shuze Chen

Assortment Optimization for a Multistage Choice Model: Revenue-ordered and nested optimal assortmentsResearch Paper

A seller may offer one catalog of products now and a different catalog later. A customer's first purchase can determine which products become available in the second stage. An airline ticket followed by an upgrade offer is one example. When customers anticipate those later offers, changing a continuation assortment can change demand in the first stage as…

10 thms3 active usersReviewed
OptimizationProbability·Captain: Shuze Chen

Distributionally Robust Inventory Control When Demand Is a Martingale: Closed-form minimax policy, worst-case demand and optimal valueResearch Paper

An inventory manager orders before seeing demand. Unsold stock incurs a holding cost, while unmet demand remains as a backlog and incurs a shortage cost. When the full demand distribution is unknown, a policy can be evaluated by its largest expected cost among distributions consistent with the available information. Dependence across periods matters because…

22 thms3 active usersReviewed
Algorithmic Game TheoryControl Theory·Captain: Shuze Chen

Optimizing Free-to-Play Multiplayer Games with Premium Subscription: Optimal advertising and subscription pricingResearch Paper

A free-to-play multiplayer game earns subscription revenue only if players value the premium experience enough to pay for it. Yet converting free players into premium players also changes the experience of everyone else. Premium players may enjoy owning items that others lack, while free players may dislike comparisons with premium players. Advertising…

7 thms3 active usersReviewed
OptimizationStatistics·Captain: Shuze Chen

Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters: Rate-optimal regret of PSCResearch Paper

A seller offering several products often shares resources across those products. A room-night can support several travel packages; a seat can serve several itineraries. Selling one product changes what remains available for future customers. When the seller does not know how purchase probabilities respond to prices, each decision also determines what can be…

12 thms3 active usersReviewed
Bandit Algorithms·Captain: Shuze Chen

Joint Learning and Optimization for Multi-Product Pricing (and Ranking) Under a General Cascade Click Model: The regret bound for UCB-CascadeResearch Paper

A seller displaying several products must learn more than the probability of a sale. A low purchase rate can reflect customers leaving before reaching a product, declining to click, or clicking and then deciding against purchase. These mechanisms matter because changing an early product's price changes both its sales and the number of customers who reach…

11 thms3 active usersReviewed
Bandit AlgorithmsProbability·Captain: Shuze Chen

Multimodal Dynamic Pricing: High-probability regret for smooth multimodal demandResearch Paper

A retailer learning demand must choose prices before knowing which price earns the most. Each sale provides information only at the price actually posted. A demand curve can have several locally attractive regions, so a method that searches near one apparent optimum can overlook a better region. Wang, Chen and Simchi-Levi study pricing under smoothness…

11 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingProbability·Captain: Shuze Chen

Distributionally Robust Markov Decision Processes: S-robust strategies are distributionally optimal and admit a saddle pointResearch Paper

A planner who controls a stochastic system often knows more than a range of possible transition probabilities, but less than a complete probability distribution for those probabilities. For example, a small confidence region may contain a parameter with probability at least 90%, while a larger region contains it with certainty. Optimizing against every…

10 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Production Planning by Mixed Integer Programming V: Intersecting Constant-Capacity Lot-Sizing HullsTextbook

A production plan must meet demand on time while deciding which periods justify a setup. When each active period can supply at most the same amount, the capacity limit links setup decisions to cumulative demand. A linear relaxation that treats those decisions as fractional may admit plans that cannot be assembled from feasible binary setup schedules.…

6 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Production Planning by Mixed Integer Programming III: The Wagner–Whitin Convex HullTextbook

A production planner must meet demand over several periods while deciding when to incur fixed setup costs. Producing early can combine several periods into one batch, but the resulting inventory carries a holding cost. Even for one item without a capacity limit, continuous production quantities interact with discrete setup decisions. An exact linear…

6 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Production Planning by Mixed Integer Programming I: Facility Location Reformulation of Uncapacitated Lot-SizingTextbook

Production planning combines continuous quantities with discrete decisions about when a machine is prepared to produce. A setup can incur a fixed charge even when the amount subsequently produced is small. Relaxing the setup decision to a fraction can therefore give a cost bound that is too optimistic. For a single product without capacity limits, a…

4 thms3 active usersReviewed
🏆Completed
Optimization·Captain: Shuze Chen

Price Discrimination with Fairness Constraints: Welfare effects of a little fairnessResearch Paper

A seller can charge different customer groups different prices when their willingness to pay differs. Limiting that discrimination changes both the seller's profit and what buyers receive. Equal prices are one possible fairness objective; equal purchase probabilities, equal consumer surplus and equal valuations among non-buyers express different concerns.…

24 thms3 active users
Algorithmic Game TheoryComplexity TheoryGraph Theory·Captain: Shuze Chen

Fair Division of a Graph: Maximin-share allocations on trees exist and can be computed in polynomial timeResearch Paper

An allocation of rooms to research groups may be impractical if one group receives rooms scattered throughout a building. The same issue appears when indivisible land plots must form a connected holding. In these examples, adjacency constrains which bundles can be allocated, while different participants may value the same items differently. Connected fair…

10 thms3 active usersReviewed
Mechanism DesignProbabilityStochastic Systems·Captain: mikedeng1

Driver Surge Pricing: Prices m_iτ + z_i q_{i→j}(τ) Make Accepting Every Trip the Unique Optimal Driver Policy When R1/R2 ∈ (C, 1), and Accepting All Surge Trips Optimal for Every R1 < R2Research Paper

Ride-hailing platforms pay drivers per trip, and drivers are free to decline requests. When demand fluctuates, a trip accepted now also decides where and when the driver will be free next. During a surge (a period of high demand and high pay) a long trip keeps a driver busy after the surge may have ended, so a driver may rationally decline trips the…

20 thms3 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Reset Sequences for Monotonic Automata: Breadth-First Search over Cyclic Intervals Finds a Minimum-Length Reset Sequence in O(kn²) TimeResearch Paper

A parts orienter takes a mechanical part in an unknown orientation and delivers it in a known one. In the pan handler studied by Natarajan, the part slides on a tray; each tilt of the tray moves it to a new resting orientation, determined by the tilt and the current orientation. Choosing a sequence of tilts that brings the part to the same final orientation…

12 thms3 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

The Minimum Latency Problem: A Polynomial-Time 144-Approximation Algorithm for the Minimum Latency Tour in Metric SpacesResearch Paper

A repairman, a delivery vehicle or a disk head starts at a depot and must visit nnn locations. The traveling salesman problem (TSP) minimizes the time at which the last visit ends. In many service settings what matters is instead the time each customer waits: the minimum latency problem (MLT), also called the traveling repairman or deliveryman problem,…

7 thms3 active usersReviewed
🏆Completed
Markov ChainOptimizationStochastic Systems·Captain: mikedeng1

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework: Elevated-Flow-Relaxation Prices Earn an m/(m+n−1) Fraction of the Optimal State-Dependent ObjectiveResearch Paper

Bike-sharing and car-sharing systems, and ride-hailing platforms, all move a fixed fleet of units between stations. Every ride takes a unit away from its origin and leaves it at its destination, so demand that is unbalanced across stations drains some stations and floods others. Pricing is the main lever an operator has: raising the price of rides out of a…

15 thms3 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System: Steepest Descent from the Center Is Optimal at Every L1 RadiusResearch Paper

Bike-sharing operators periodically move docks between stations: a station that often runs out of bikes or of open docks frustrates users, but every moved dock costs money. Freund, Henderson and Shmoys modelled this dock re-allocation problem as a separable nonlinear integer program with a budget on the number of moved docks (Freund–Henderson–Shmoys, IPCO…

17 thms3 active usersReviewed
Control TheoryOptimizationPartial Differential Equations·Captain: mikedeng1

Hamilton-Jacobi Equations with Semilinear Costs and State Constraints, with Applications to Large Deviations in Games: Verification Theorem for the State-Constrained Target ProblemResearch Paper

Stochastic evolutionary game dynamics model a population of NNN agents who occasionally revise their actions by a noisy best-response rule with noise level η>0\eta>0η>0. As η→0\eta\to0η→0, the population spends long periods near Nash equilibria and occasionally transits between them; the exponential rates of these transitions, and hence which equilibrium is stochastically…

13 thms3 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration: Fluctuation Identities for Branching Processes with ImmigrationResearch Paper

A Markov branching process with immigration (MBI) models a population in continuous time: each individual independently dies, splits or is removed at affine rates, and batches of immigrants arrive at a constant rate. Such processes appear in population biology, queueing (infinite-server systems with batch arrivals), epidemics and the analysis of branching…

20 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Large Independent Sets in Recursive Markov Random Graphs: For Every r < 1 and ε > 0, With High Probability α(G^r_{n,p}) ≥ ((1 − r)/(2 + ε))·n/log nResearch Paper

The stability number α(G)\alpha(G)α(G) of a graph, the largest number of pairwise non-adjacent vertices, is one of the basic parameters of combinatorial optimization: computing it is NP-hard, and random graphs are the standard test bed for what typical instances look like. For the Erdős–Rényi–Gilbert graph Gn,pG_{n,p}Gn,p​, in which every edge is present independently, the…

17 thms3 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: mikedeng1

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems: Dispatching to One Remembered Server, Updated by Queue-Length Messages, Is Stable for Every Vector of Server RatesResearch Paper

A central dispatcher that routes jobs to parallel servers is the basic model behind web server farms, cloud schedulers and call centers. When the servers have different speeds, and the speeds are not known to the dispatcher, two classical policies behave very differently. Random routing is cheap but unstable as soon as some server is slower than the average…

8 thms3 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

The Secretary Problem with Predictions: Learned Dynkin Is max{0.215, (1−ε)/(1+ε)}-CompetitiveResearch Paper

The secretary problem asks how to hire the best of nnn candidates who are interviewed one at a time in random order, when every hiring decision must be made irrevocably at the interview. It is the standard model of online selection under uncertainty, and its answer, Dynkin's rule, hires the maximum with probability 1/e1/e1/e (Dynkin 1963; see the survey of Ferguson…

12 thms3 active usersReviewed
PreviousPage 41 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