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
Reinforcement LearningTheoretical Computer Science·Captain: mikedeng1

Speeding up Policy Simulation in Supply Chain RL: Picard Iteration for Fulfillment Converges in at Most One More Iteration than the Number of Nodes That Run Out of CapacityResearch Paper

Training and back-testing a reinforcement-learning policy for a supply chain requires policy simulation: given an initial state, a horizon TTT and a sequence of exogenous events, compute the actions the policy takes when the system evolves under its own decisions. In large online retail networks the horizon is the number of customer orders, in the millions,…

9 thms2 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: mikedeng1

Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents: Above Load b_max/t_{b_max} Every Scheduler Diverges, Below It Every Work-Conserving K-FCFS Scheduler Is Positive RecurrentResearch Paper

A large language model (LLM) answers a request in two phases. In the prefill phase it reads the whole prompt; in the decode phase it generates the answer one token at a time, because each new token depends on all previous ones. Serving engines such as vLLM, SGLang and Sarathi-Serve run the GPU in iterations: each iteration processes one batch that may mix…

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

New Combinatorial Insights for Monotone Apportionment: House-Monotone and Quota-Compliant Apportionments Are the Seat Counts of Extreme Points of a Network Flow LP with Lookahead Φ(p, H)Research Paper

An apportionment method distributes the HHH seats of a house among nnn states in proportion to their populations. Exact proportionality is impossible with integer seats, so methods are judged by axioms. Two axioms date back to the debates over the seats of the US House of Representatives. Quota compliance asks that each state receive its exact proportional…

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

Decomposition of Games: Some Strategic Considerations: Duplicating a Strategy Commutes with the (μ,γ)-Decomposition into Potential, Harmonic and Nonstrategic ComponentsResearch Paper

A finite game can be split into simpler pieces. Candogan, Menache, Ozdaglar and Parrilo (Math. Oper. Res. 36 (2011)) showed that the space of finite games is the direct sum of potential, harmonic and nonstrategic games: potential games have pure equilibria and well-behaved learning dynamics, harmonic games generalize matching pennies, and nonstrategic games…

18 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information: The Value Is 2qμ + (p − q)D, Attained by the Recursive Hider Distribution and the Favoring-Bias SearcherResearch Paper

Search games model a Searcher looking for an object or a person whose location is chosen adversarially: a lost hiker, a mine, a hidden explosive device, a fugitive. In the classic search game on a tree, a Hider stands still at a point of a tree network, and a Searcher starts from the root and moves at unit speed. The payoff is the time to find the Hider. Gal…

8 thms2 active usersReviewed
🏆Completed
Graph TheoryProbabilityStatistics·Captain: mikedeng1

Differences-in-Neighbors for Network Interference in Experiments: The DN Estimator Has Bias at Most d²ε Under ε-Smooth Neighborhood InterferenceResearch Paper

Online platforms, social networks and marketplaces run randomized experiments (A/B tests) to estimate the effect of a new feature. The standard analysis assumes that one unit's treatment does not affect another unit's outcome. On a network this fails: a treated user changes what their friends see, a treated seller changes what competing sellers sell. The…

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

Internal Capital Allocation, Voluntary Disclosure, and Investment Efficiency: When a Multi-Divisional Firm Beats Two Stand-Alone FirmsResearch Paper

Conglomerates and stand-alone firms finance projects differently. A multi-divisional firm runs an internal capital market: headquarters raises funds externally and then decides which division gets them. A stand-alone firm must raise capital project by project. A long line of work in corporate finance asks when the internal market is more efficient: Stein (19…

8 thms2 active usersReviewed
🏆Completed
EconomicsMachine Learning·Captain: mikedeng1

Decision Forest: A Nonparametric Approach to Modeling Irrational Choice: Every Customer Choice Model Is a Decision Forest of Depth at Most N + 1Research Paper

Retailers, airlines and platforms decide which products to offer by predicting how customers substitute among them. Such predictions rest on a discrete choice model: for every set of offered products, a probability distribution over what a customer buys. The classical models are built on random utility maximization (RUM): each customer draws utilities and…

7 thms2 active usersReviewed
🏆Completed
Experimental DesignOptimizationStatistics·Captain: mikedeng1

Optimal Experimental Design for Staggered Rollouts: S-Shaped, Covariate-Balanced Rollouts Maximize the Trace of the GLS Precision of Instantaneous and Lagged EffectsResearch Paper

Firms and public agencies often roll a new product, feature or policy out gradually: a few markets first, more later, every market eventually. When the rollout is itself an experiment, its schedule determines how precisely the effect of the treatment can be estimated. A staggered rollout is the common design in which treatment, once switched on in a unit,…

7 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimizationStochastic Systems·Captain: mikedeng1

Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure: Mirror Backpressure Loses at Most O(K/T + 1/K + √(ηK)) Payoff per CustomerResearch Paper

Ride-hailing, car-sharing and bike-sharing platforms, as well as scrip systems, move a fixed stock of reusable resources around a network. Each customer that is served relocates one unit, from a pick-up location to a drop-off location. The operator decides, customer by customer, whether to serve and with which unit. Supply can run dry at a location, which…

15 thms2 active usersReviewed
🏆Completed
Mechanism DesignOptimization·Captain: mikedeng1

When Is Assortment Optimization Optimal?: Under History-Monotone Futures, Assortments Are Optimal Among All IC MechanismsResearch Paper

Assortment optimization is the problem of choosing which items to offer a customer who buys at most one item, when each item has a fixed, exogenous price. It is one of the central problems of revenue management: the customer's behaviour is described by a choice model, and a large literature computes optimal assortments under specific models, from the…

10 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsProbability·Captain: mikedeng1

Learning to Rank an Assortment of Products: The Simple Learning Algorithm Hooks Half the Optimal Ranking's Customers up to ε with Probability 1 − δResearch Paper

Online retailers display hundreds of products in a list or a grid, and most visitors never scroll far. A customer who finds nothing appealing near the top leaves without engaging at all, so the order of the first few slots decides whether a visit turns into a click, and through it into a sale. Ferreira, Parthasarathy and Sekar (SSRN 3395992; Management…

9 thms2 active usersReviewed
🏆Completed
Economics·Captain: mikedeng1

The Joint Determination of Haircuts and Interest Rates for Collateralized Loans in Shadow Banking: Better Downside Collateral Quality Lowers the Haircut Iff E[ω | ω > ω*] > (e₀ − e₁)/KResearch Paper

Collateralized short-term loans, repurchase agreements above all, are the funding market of shadow banking. Each such loan carries two terms: an interest rate and a haircut, the fraction of the collateral's value that the lender does not finance. Studies of repo terms by collateral type around the 2007–2009 crisis (Gorton and Metrick, 2012; Krishnamurthy,…

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

On Time-Consistent Equilibrium Stopping Under Aggregation of Diverse Discount Rates: The Smallest One-Barrier Equilibrium Is the Optimal EquilibriumResearch Paper

A group that shares one stopping decision (a board deciding when to abandon an R&D project, a fund deciding when to exercise a real option) rarely shares one discount rate. A standard way to aggregate heterogeneous time preferences is to treat the discount rate ρ\rhoρ as random with law FρF_\rhoFρ​ and to average discounted payoffs over it. Weitzman (2001) showed…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationOptimization·Captain: mikedeng1

Exact Penalization of Generalized Nash Equilibrium Problems: Under a Slater-Type Condition, Every Equilibrium of the ℓq-Penalized Nash Game Solves the Generalized Game for All Large PenaltiesResearch Paper

In a generalized Nash equilibrium problem (GNEP) each player's feasible set depends on the strategies of the other players. Such coupled constraints arise wherever players share a resource: transmission capacity in electricity and telecommunication markets, emission caps in environmental games, track time in railway pricing, road capacity in transportation…

8 thms2 active usersReviewed
🏆Completed
Dynamic Programming·Captain: mikedeng1

Demand Shaping Through Bundling and Product Configuration: A Dynamic Multiproduct Inventory-Pricing Model: Under Bundle-to-Stock, the Optimal Policy Is Dictated by a No-Order SetResearch Paper

Firms that sell configurable products — computers, cable and phone packages, meal combos — decide not only how much to stock but also which bundles of components to offer and at what prices. Bundling decisions interact with inventory: offering a bundle draws on several items at once, and an overstocked item is a reason to push the bundles that use it. Song…

8 thms2 active usersReviewed
🏆Completed
EconomicsStatistics·Captain: mikedeng1

Herding in Probabilistic Forecasts: The Normal Forecast with the Morris–Shin Mean and Variance a(x−y)²+d Is an Equilibrium, Unique Among Polynomially Bounded ProfilesResearch Paper

Panels of professional forecasters — the European Central Bank's Survey of Professional Forecasters, the Federal Reserve's surveys, election and sports forecasters — increasingly report probabilistic forecasts: a whole predictive distribution rather than a single number. Aggregating such panels presumes that each forecast reflects the forecaster's own…

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

Projectively Self-Concordant Barriers: Projective Self-Concordance with γ = (ν − 2)/√(ν − 1) Is Equivalent to Self-Concordance of the Logarithmically Homogeneous Extension ν(−log t + f(x/t))Research Paper

Interior-point methods for convex programming, introduced in their modern form by Nesterov and Nemirovski, run Newton's method on a barrier function of the feasible set. Their complexity analysis rests on a single analytic property of the barrier, self-concordance: the third derivative is controlled by the second, ∣F′′′(x)[h,h,h]∣≤2 (F′′(x)[h,h])3/2|F'''(x)[h,h,h]|\le 2\,(F''(x)[h,h])^{3/2}∣F′′′(x)[h,h,h]∣≤2(F′′(x)[h,h])3/2.…

10 thms2 active usersReviewed
🏆Completed
EconomicsOptimization·Captain: mikedeng1

If It Is Surely Better, Do It More? Implications for Preferences Under Ambiguity: Ambiguity Aversion Toward an Event Breaks Monotonicity in Optimal Mixtures for c-Linearly Biseparable PreferencesResearch Paper

Many economic and managerial decisions are choices of a mixing weight: how much effort to put on one sale rather than another, how much wealth to put in a risky asset, how to split a portfolio between two contracts. A natural comparative-statics requirement is that if one of the two options is improved in every state of the world, the decision maker should…

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

A Single-Loop Algorithm for Decentralized Bilevel Optimization: O(1/K) Stationarity and Consensus Rates of SLDBO without Heterogeneity AssumptionsResearch Paper

Bilevel optimization chooses an upper-level variable xxx to minimize an objective that depends on the solution y∗(x)y^*(x)y∗(x) of a lower-level problem. Hyperparameter tuning and meta-learning are the standard examples (Franceschi et al. 2018; Ghadimi and Wang 2018). In the decentralized version the data are split among nnn agents. Each agent sees only its own upper-…

17 thms2 active usersReviewed
🏆Completed
ProbabilityReinforcement Learning·Captain: mikedeng1

Relaxed Equilibria for Time-Inconsistent Markov Decision Processes: A Relaxed Equilibrium Exists in Discrete Time without Convexity, via Vanishing Entropy RegularizationResearch Paper

An agent who maximizes an expected sum of rewards over time is time-inconsistent when the plan that is optimal today stops being optimal tomorrow. This happens as soon as discounting is not exponential: with hyperbolic or quasi-hyperbolic discounting, a reward far in the future is weighed differently at time 0 and at time 1, and the agent's future selves…

15 thms2 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Optimal Subscription Planning for Digital Goods: Under Condition 2, a Single Grand Subscription Set With a Suitable Fee Achieves the Optimal RevenueResearch Paper

Digital-goods platforms (video, music, e-books, software) sell access in two ways at once: subscriptions, which give unlimited use of a set of items for a period, and rentals, which charge per use. A platform with a large catalogue could offer many subscription sets at different fees, but most platforms offer a single all-inclusive subscription. Alaei,…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear algebra·Captain: mikedeng1

Analytical Solution to a Discrete-Time Model for Dynamic Learning and Decision Making: the two-action frontier difference equations have a unique closed-form solution with explicit det YResearch Paper

Many sequential decisions trade off immediate reward against information: a firm prices without knowing which demand regime it faces, a clinician treats without knowing a patient's type, a bandit player pulls a risky arm to learn its mean. Formally these are partially observed Markov decision problems (POMDPs) with a hidden but fixed state. Their value…

10 thms2 active usersReviewed
🏆Completed
EconomicsOptimization·Captain: mikedeng1

What Is the Impact of Nonrandomness on Random Choice Models?: Revenue-Ordered Assortments Are Optimal When One Product's Utility Is DeterministicResearch Paper

Retailers choose which products to show a customer, and the customer chooses at most one of them. The assortment problem asks for the offer set that maximizes expected revenue, given a model of how customers choose. Under the multinomial logit (MNL) model every alternative, the no-purchase option included, carries an independent Gumbel noise term of the…

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

Coordination for Assembly: With at Most M − 1 Feedback Periods, the Subgame-Perfect Secure Equilibrium Has Every Contractor Exert the Minimum Effort in Every PeriodResearch Paper

Assembly projects such as aircraft programs or large software releases split work among several contractors, each responsible for one component. The finished product can only be as advanced as its least-developed component, so the contractors play a minimum-effort game (also called a weakest-link game): the project's value depends on the minimum of the…

5 thms2 active usersReviewed
PreviousPage 70 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