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
ProbabilityStochastic Systems·Captain: mikedeng1

Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement: The Optimal Retirement Boundary Increases Near the Mandatory Retirement Age and Tends to Labor Cost over IncomeResearch Paper

Retirement timing is an optimal stopping decision: continuing work earns income but incurs labor cost, while stopping removes both. In the investment model of Jang, Xu and Zheng, the decision also interacts with asset returns and with consumption of basic and luxury goods. The paper separates the retirement decision from the individual's utility…

9 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Power Forward Performance in Semimartingale Markets with Stochastic Integrated Factors: Necessary and Sufficient Conditions for a Power Forward Performance Process under Portfolio ConstraintsResearch Paper

Classical utility maximization fixes a utility function at a terminal horizon and optimizes backwards. Forward investment performance processes (FIPPs), introduced by Musiela and Zariphopoulou (2008; 2010), drop the fixed horizon: the investor's preferences are a random field Ut(x)U_t(x)Ut​(x) specified today and updated forward in time, in such a way that every past…

10 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information: Diffusion-Scaled Queue Lengths and Routed Arrivals Converge to the Unique Solution of the Diffusion ModelResearch Paper

Load balancing is the problem of routing a single stream of jobs to several parallel servers so that no server sits idle while another has a long queue. The classical rule, join the shortest queue (JSQ), needs the current length of every queue at every arrival. In large server farms and distributed systems this information arrives late: the dispatcher…

20 thms2 active usersReviewed
Bandit AlgorithmsDynamic ProgrammingOptimization+1·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices VIII: Index Theorems for Non-Preemptive Jobs under Precedence Constraints and Out-ForestsTextbook

Scheduling jobs on a single machine under precedence constraints ("job iii must be completed before job jjj may be started") is one of the oldest problems of operations research, and with random service times and discounted rewards it is a family of alternative bandit processes that is not simple: the set of jobs that may be served changes as jobs are…

7 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Liquidity as a Proxy for Nonlinear Price Impact: Stable Convergence of the Nonlinear Propagator Model to a Linear Impact Model with Stochastic LiquidityResearch Paper

A trade moves the price at which subsequent trades are executed. Price impact models describe this shift as a function of the signed order flow and are the basic input of optimal execution and statistical-arbitrage problems. Empirically, the immediate impact of a trade is a concave function of its size, close to a square root for large orders (Bouchaud et…

11 thms2 active usersReviewed
ProbabilityStatistics·Captain: mikedeng1

Subsampling to Enhance Efficiency in Input Uncertainty Quantification: The Proportionate Subsampled Variance Bootstrap Is Relatively ConsistentResearch Paper

A simulation may give precise answers under specified input distributions while the distributions themselves are estimated from limited data. In a queueing model, for example, arrival and service times are fitted from observations before the queue is simulated. Repeating the simulation more often reduces simulation noise, but it does not remove uncertainty…

8 thms2 active usersReviewed
EconomicsProbability·Captain: mikedeng1

Liquidity Provision with Adverse Selection and Inventory Costs: The Solution of a Nonlinear ODE for Marginal Prices Is the Unique Symmetric Nash Equilibrium of K Competing DealersResearch Paper

Much of the trading in options, bonds and other over-the-counter products does not go through a limit order book. A client approaches several dealers, each dealer quotes a price schedule (the total price for each trade size), and the client splits the order among them. The dealers face two costs. The first is adverse selection: clients who trade large…

16 thms2 active usersReviewed
Dynamic ProgrammingEconomics·Captain: mikedeng1

Voluntary Disclosure, Moral Hazard, and Default Risk: Greater Availability of Evidence Raises Firm Value and Lowers the Credit Spread, Strictly Above the First Termination ThresholdResearch Paper

Firms are run by managers who know more about cash flows than investors do. In the dynamic agency literature that started with DeMarzo and Fishman (2007) and DeMarzo and Sannikov (2006), a manager can divert cash by under-reporting output, and investors deter diversion with a contract that promises future pay after good reports and threatens liquidation…

9 thms2 active usersReviewed
Actuarial ScienceProbability·Captain: mikedeng1

Affine Storage and Insurance Risk Models: Closed Form for the Joint Transform of Ruin Time, Overshoot and Undershoot Before an Exponential Horizon from an Exponential Initial SurplusResearch Paper

Classical ruin theory studies the Cramér–Lundberg model: an insurer's capital grows linearly through premiums and drops at the arrival epochs of a compound Poisson stream of claims. Two features of real capital processes are missing from it. Free capital earns interest, so the drift depends on the current level. And a firm may receive capital injections,…

15 thms2 active usersReviewed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Testing, Voluntary Social Distancing, and the Spread of an Infection: Greater Testing Raises the Equilibrium Infection Probability of the Type That Mixes Its Social ActivityResearch Paper

Testing makes an infected person less likely to pass an infection to someone else. In a society whose contacts depend on voluntary social activity, that direct benefit changes behavior: an agent who expects fewer infections may choose more contacts. The central question is whether the added contacts can outweigh the direct benefit of testing in equilibrium.…

14 thms2 active usersReviewed
Algorithmic Game TheoryCombinatoricsMechanism Design·Captain: mikedeng1

Polyhedral Clinching Auctions for Two-Sided Markets: An Incentive-Compatible, Individually Rational, Budget-Balanced, Pareto-Optimal Mechanism ExistsResearch Paper

Auctions in which bidders face budget constraints do not fit the classical quasi-linear theory: a bidder cannot pay more than a fixed amount, however much the goods are worth to him. For a single divisible good, Dobzinski, Lavi and Nisan showed that the adaptive clinching auction of Ausubel is incentive compatible, individually rational and Pareto optimal,…

12 thms2 active usersReviewed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Strategic Inventories under Supply Chain Competition: Under Fierce Chain-to-Chain Competition, Strategic Inventories Leave All Manufacturers and Retailers Strictly Worse OffResearch Paper

A manufacturer that sells through an independent retailer charges a wholesale price above cost, and the retailer then adds its own margin: the double marginalization problem of vertical contracting. Anand, Anupindi and Bassok (Management Science 2008) showed that in a two-period monopoly chain the retailer can blunt this by buying more than it sells in the…

8 thms2 active usersReviewed
Algorithmic Game TheoryControl TheoryProbability+1·Captain: mikedeng1

Dynkin Games with Incomplete and Asymmetric Information: With Linear Payoffs, a Threshold Stop and a Belief-Reflecting Randomised Stop Form a Saddle PointResearch Paper

An optimal stopping game asks two players to choose when to stop a shared process. The first player receives one payoff if they stop first and another if the second player stops first. Such a game changes when one player knows a parameter that the other can only infer from observations. The informed player can reveal information through the timing of a…

19 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling: Fluid-Scaled States Are Tight and Their Limit Points Are Fluid Model SolutionsResearch Paper

Call centers, hospital wards and other service systems with many agents serve several customer classes, and customers who wait too long hang up or leave. The standard model is the multiclass many-server queue with reneging: NNN identical servers, JJJ classes, class-dependent service-time and patience-time distributions, and a control policy that decides when an…

10 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times: Fluid Limit of the Maximum Queue Length with a Non-Zero Initial ConditionResearch Paper

A fork-join queue splits every incoming job into tasks, sends one task to each of NNN parallel servers, and declares the job complete only when all tasks are done. The model describes assembly systems in which a manufacturer orders parts from NNN suppliers and can only start production when every part has arrived, as well as parallel computing and storage…

17 thms2 active usersReviewed
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

Discrete Dividend Payments in Continuous Time: The Value Function Is the Unique Fixed Point of the One-Period Dividend-and-Issuance OperatorResearch Paper

A firm can return cash to shareholders by paying dividends, but a payment reduces the reserves available to survive future losses. If cash can be distributed only at scheduled dates while equity can be raised between those dates, the firm must coordinate a discrete dividend decision with a continuous-time financing decision. Keppo, Reppen and Soner study…

9 thms2 active usersReviewed
Algebraic GeometryConvex OptimizationOptimization·Captain: mikedeng1

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization: The Set of Transition Points of the Optimal Partition Is FiniteResearch Paper

Sensitivity analysis asks how the solution of an optimization problem changes when its data move. For linear optimization the answer has been known since the 1990s: as the objective is perturbed along a fixed direction, the optimal partition (which variables can be positive at an optimum and which slacks can) stays constant on open intervals and changes…

11 thms2 active usersReviewed
Optimization·Captain: mikedeng1

Optimal Use and Replenishment of Two Substitutable Raw Materials in a Stochastic Capacitated Make-to-Order Production System: A Use-Down-To/Balancing Production Policy Is OptimalResearch Paper

Make-to-order manufacturers may use two substitutable raw materials to satisfy demand when production capacity and material deliveries are uncertain. A cheaper material may yield less finished product per unit, and the firm must decide how much of each material to preserve for later periods. A production rule based only on current unit costs can be wrong…

11 thms2 active usersReviewed
Graph TheoryProbability·Captain: mikedeng1

A Dynamic Contagion Risk Model with Recovery Features: Fluid Limit for the Final Fraction of Failed Nodes in Threshold Contagion with Growth on the Configuration ModelResearch Paper

Financial networks, supply chains and contact networks share a failure mode: a node fails when enough of its counterparties have failed, and its failure in turn weakens its own counterparties. Threshold contagion on random graphs is the standard mathematical model of this. Amini, Cont and Minca (Resilience to contagion in financial networks, Mathematical…

10 thms2 active usersReviewed
Machine LearningMarkov ChainStatistics·Captain: mikedeng1

Learning Markov Models Via Low-Rank Optimization: KL Error Bound for the Rank-Constrained Maximum Likelihood Estimator of a Low-Rank Markov ChainResearch Paper

Many systems studied in operations research and reinforcement learning are modelled as finite Markov chains with a large number of states ppp: the stops of a taxi in a city, a random walk on a network, the conformations of a molecule. Estimating the p×pp\times pp×p transition matrix from one observed trajectory needs, in general, a trajectory long compared with the …

13 thms2 active usersReviewed
Economics·Captain: mikedeng1

Skill Acquisition and Data Sales: Under Uncertain Skill Acquisition and Accurate Data, Higher Skill-Acquisition Costs Raise Data Clarity, Data Price and Price InformativenessResearch Paper

Asset managers increasingly buy alternative data: satellite images, credit-card panels, web traffic. Raw data of this kind is worthless until someone has the skills to process it, and those skills are costly and uncertain to acquire. A fund can hire data scientists and still find that its models extract little. Huang, Xiong and Yang (Management Science, 2022…

11 thms2 active usersReviewed
Control TheoryOptimization·Captain: mikedeng1

Managing Self-Replicating Innovative Goods: Characterization of the Optimal Production and Sales Policies under Strong ReplicabilityResearch Paper

Some goods can only be made by copies of themselves. RepRap and Prusa 3D printers print the parts of new printers, seed stock is grown from seed, and livestock herds breed. For such a good the inventory is also the production capacity: a unit sold today is a unit that will not replicate tomorrow. A firm launching such a good has to decide, at every instant,…

8 thms2 active usersReviewed
Algorithmic Game TheoryControl TheoryProbability+1·Captain: mikedeng1

Nonzero-Sum Stochastic Games and Mean-Field Games with Impulse Controls: A Regular Solution of the N-Player Quasi-Variational Inequalities Gives a Nash EquilibriumResearch Paper

An impulse control changes a system's state at a chosen instant, rather than continuously adjusting its drift. When several decision makers can intervene in the same state process, an intervention changes both the acting player's future cost and every opponent's. This makes the equilibrium question different from separate single-player control problems.…

11 thms2 active usersReviewed
EconomicsProbability·Captain: mikedeng1

A General Analysis of Sequential Social Learning: Asymptotic Learning Holds for Every Utility Function if and only if Private Signals Are Totally UnboundedResearch Paper

In sequential social learning, agents act one after another. Each agent observes the actions of its predecessors and a private signal about an unknown state of the world. The model explains herd behaviour, information cascades and the adoption of products, technologies and opinions when people imitate one another. The basic question is whether the…

13 thms2 active usersReviewed
Algorithmic Game TheoryPartial Differential EquationsProbability·Captain: mikedeng1

Finite State Mean Field Games with Wright–Fisher Common Noise as Limits of N-Player Weighted Games: Normalized N-Player Equilibrium Values Converge to the Master Equation at a Polynomial RateResearch Paper

Mean field games describe Nash equilibria of games with very many symmetric players by a single limiting object. Whether, and how fast, the equilibria of the NNN-player game converge to that limit is the convergence problem. For games with common noise, a source of randomness shared by all players, the standard route goes through the master equation, a PDE on…

12 thms2 active usersReviewed
PreviousPage 28 of 39Next

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