Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Stochastic Systems

635 missions · 329 completed

The mathematics of systems that evolve under randomness, modeled as families of random variables indexed by time — from Markov chains and martingales to Brownian motion and stochastic differential equations. The field spans stochastic analysis, filtering and optimal control under uncertainty, ergodic behavior of random dynamics, and concentration of measure, with models reaching across physics, engineering, finance, and biology.

Missions

Open306Completed329All635
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

Evolution of Shares in a Proof-of-Stake Cryptocurrency: Under Coin Rewards R_t = ρN_{t−1}^γ, Limiting Investor Shares Concentrate at the Initial Share as N → ∞ if and only if γ < 1Research Paper

In a Proof-of-Stake (PoS) cryptocurrency, new coins are not mined with computing power: before each date the protocol picks one coin holder at random, with probability equal to the fraction of coins she holds, and pays her a reward of new coins. A common claim in the cryptocurrency press is that this makes the rich richer: larger holders are selected more…

13 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Online Allocation and Pricing: Constant Regret via Bellman Inequalities: Regret Is at Most the Information Loss Plus the Bellman LossResearch Paper

An online allocator must commit to an action after each arrival, although later arrivals can change which actions would have been best. Revenue management and online resource allocation use regret to measure the expected reward lost against a benchmark. If the benchmark sees too much future information, this gap can grow with the horizon even when the…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Experimental Design in Two-Sided Platforms: An Analysis of Bias: In Demand-Constrained Markets the Naive Customer-Side Estimator Is Unbiased and the Listing-Side Estimator Is Generically BiasedResearch Paper

Online marketplaces such as lodging, ride-hailing and freelancing platforms test changes to their product (a new ranking, a new fee display, a new photo layout) with randomized experiments. In a two-sided marketplace these experiments are subject to interference: treated and control units compete for the same scarce supply or demand, so the outcome of one…

11 thms2 active usersReviewed
🏆Completed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Dual Sourcing and Smoothing Under Nonstationary Demand Time Series: Reshoring with SpeedFactories: When the Break-Even Price Is Concave, Dual Sourcing with a SpeedFactory Beats Full Off-ShoringResearch Paper

Firms that moved production offshore for low unit costs pay for it in lead time: a slow global supplier forces large safety stocks, and the cost of those stocks grows with demand variability. A recurring question in operations management is when it pays to re-shore part of production to a fast, local, more expensive plant. Adidas's "SpeedFactories" are the…

10 thms2 active usersReviewed
🏆Completed
AnalysisOperations Research·Captain: mikedeng1

Provably Good Region Partitioning for On-Time Last-Mile Delivery II: An ε-Equitable Partition Keeps Each Subregion's Delivery Time Within 4η/(1−η)² of OptimalResearch Paper

A delivery company can assign each driver a permanent district instead of allowing every driver to serve the whole city. This makes dispatching simpler, but it raises a service question: if the districts receive almost equal shares of demand and travel workload, how different can their expected delivery times be? Carlsson, Liu, Salari and Yu study this…

7 thms2 active usersReviewed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing 1: Arc Balancing Control Has Loss O(log(1+n)^{3/2}/n^{2/3})Research Paper

A ride-hailing firm chooses prices while drivers move through a city. A trip from one region uses a driver immediately and returns that driver at another region only after a travel delay. Prices affect which trips are requested, but the actual requests fluctuate. A plan that ignores these fluctuations can run out of available drivers at a busy origin even…

7 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Managing Outpatient Service with Strategic Walk-ins II: The Triage Model Costs Less When C_L/C_O ≤ α̲ and the Strategic Model Costs Less When C_L/C_O ≥ ᾱResearch Paper

Many outpatient clinics offer two ways in: an appointment booked online, and walk-in hours on the day. Some patients have no choice (acute cases arrive as walk-ins), but many can pick either channel, and they pick the one that costs them less: a long appointment delay pushes them into the walk-in room, a crowded walk-in room pushes them to book or to give…

15 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Managing Outpatient Service with Strategic Walk-ins I: With Total Capacity μ ≤ √(λC_D/(2R)), the Observable Scheduling Setting Costs No More Than the Unobservable OneResearch Paper

Outpatient clinics serve two kinds of patients: those who book an appointment and those who walk in on the day. Many providers now run open-access or hybrid schedules, which reserve part of the day for walk-ins. Whether patients book or walk in depends on what they know about the appointment delay. Some clinics publish the next available slot in real time…

10 thms2 active usersReviewed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime: The Two-Barrier Drift-Rate Control Policy Is OptimalResearch Paper

A manufacturer that makes several products to stock for price-sensitive customers controls three levers at once: the prices it posts, which shape demand; outsourcing, which clears a large backlog at a cost; and scheduling, which decides which product the single server makes next. Ata and Barjesteh (Operations Research 71(1), 2023) study this multiclass…

19 thms2 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOperations Research·Captain: mikedeng1

A Dynamic Model for Managing Volunteer Engagement I: The Bellman Equation of the Drift-Rate Control Problem Has a SolutionResearch Paper

Non-profit organizations depend on volunteers whose availability they cannot schedule. They can only influence it, through recruiting drives, reminders and recognition events. Ata, Tongarlak, Lee and Field (arXiv:2312.02920) model a food-recovery non-profit's volunteer pool as a queueing network. Repeat volunteers rest between shifts, one-time volunteers…

17 thms2 active usersReviewed
Actuarial ScienceOperations ResearchPartial Differential Equations·Captain: mikedeng1

Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon I: The HJB Variational Inequality Has a Unique Classical Solution with v_x ≥ 1, v_xx ≤ 0 and λv_x + v_xx ≥ 0Research Paper

An insurer that pays dividends to its shareholders faces a trade-off studied since de Finetti (1957): paying out surplus early raises the discounted payout but brings ruin closer. Reinsurance changes the trade-off, because ceding part of each claim lowers the volatility of the surplus at the price of a reinsurance premium. When the insurer may choose both…

13 thms2 active usersReviewed
Actuarial ScienceOperations ResearchPartial Differential Equations·Captain: mikedeng1

Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon II: For Discrete Claims the Reinsurance Boundaries Are C¹, Start at 0 and Are Spaced Less Than (z_j − z_{j−1})/2c ApartResearch Paper

An insurance company pays out dividends to its shareholders and buys reinsurance to limit its exposure to large claims. Both decisions are dynamic: the right amount to cede and the right moment to pay depend on the current surplus and on the time left until a fixed maturity TTT. Guan, Xu and Zhou (2023) solve the combined problem for a diffusion-approximated…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Pricing in On-Demand and One-Way Vehicle-Sharing Networks 2: With Workload Budget K, Static Prices Earn a Demand-Independent 1 − O(1/√K) Fraction of the Fluid OptimumResearch Paper

One-way vehicle-sharing systems (car sharing, bike sharing, ride-hailing fleets) set a price for every origin–destination trip. Prices decide which trips are taken, and so they decide where vehicles end up. Pricing that depends on the current position of every vehicle is in principle optimal, but its state space grows combinatorially with the fleet.…

11 thms2 active usersReviewed
Linear OptimizationMarkov ChainOperations Research+1·Captain: mikedeng1

Dynamic Matching: Characterizing and Achieving Constant Regret I: Under General Position the Exhaustive Resolving Policy Has Regret at Most Γ/ϵ at All TimesResearch Paper

Centralized matching markets (kidney exchange, ride hailing, freight and labor platforms) repeatedly decide which waiting participants to match now and which to hold for a better opportunity later. Matching early collects value sooner; waiting lets the platform see more arrivals and avoid matches that later turn out to be wasteful. A natural yardstick is…

14 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Opinion Dynamics on Directed Complex Networks 2: Without Memory on a Galton-Watson Limit, E[R*] = dE[Z_∅] + cE[Z_1] and Var(R*) = d²Var(Z_∅) + ρ*₂d²Var(Z_1)/(1 − ρ₂)Research Paper

Linear opinion models describe each individual's opinion as a weighted average of the opinions of the people they listen to, of an outside signal, and of their own previous opinion. The model goes back to DeGroot (DeGroot 1974) and Friedkin–Johnsen, and its basic questions are when a population reaches consensus and when it polarizes. Fraiman, Lin and…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 5: In a Large Supply-Rich Market, a Driver-to-Vehicle Ratio of 1/α Asymptotically SufficesResearch Paper

Tele-driving separates a ride-hailing driver from the vehicle: a remote driver operates a car over a wireless link, and on finishing a trip can immediately take control of another car anywhere in the service region. Several companies have run pilots of this model; Benjaafar, Wang and Yang cite Vay's car-sharing service operated by tele-drivers and Halo's…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 4: In a Large Intermediate Market, Remote Drivers Bring No Asymptotic Service-Level GainResearch Paper

In a conventional ride-hailing system every vehicle needs its own driver. Tele-driving, in which a vehicle is driven by a remote operator over a network, separates the two: a pool of nnn remote drivers can serve a fleet of m≥nm \ge nm≥n vehicles, each driver taking control of an idle vehicle near the next customer. Fewer drivers mean lower labor cost, but also…

6 thms2 active usersReviewed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

A Stationary Mean-Field Equilibrium Model of Irreversible Investment in a Two-Regime Economy: A Unique Stationary Mean-Field Equilibrium Exists and Invests at Regime-Dependent BarriersResearch Paper

Industries in which capacity can be built but not sold back (energy generation, manufacturing, mining) are studied through irreversible investment models: a firm controls a nondecreasing investment process and trades the cost of capacity against uncertain future revenues. When many small firms compete, each firm's revenue depends on aggregate production…

14 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Stability of a Queue Fed by Scheduled Traffic at Critical Loading 2: With Finite-Variance Service Times, t^(-1/2) W(t) Converges in Distribution to σ Times Reflected Brownian Motion at Time 1Research Paper

Appointment systems, airport runways, outpatient clinics and container terminals do not receive customers at random: each customer is scheduled at a fixed slot and arrives near it, early or late by a random amount. Queues fed by such scheduled traffic have been studied since Winsten (1959) and Mercer (1960). Kingman (1962) showed that, below critical load…

14 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Managing Resources for Shared Micromobility: Approximate Optimality in Large-Scale Systems: The Transient-Horizon Mean-Field Policy Has Optimality Gap at Most γCγᵀ/(1 − γ)Research Paper

Shared bike and scooter systems (micromobility) must decide, every period, how to move vehicles between stations, which depleted vehicles to recharge, and how many vehicles to source from or return to a central warehouse. Customer trips redistribute the fleet in the meantime, and some vehicles come back with a depleted battery. For a realistic network, the…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Stability of a Queue Fed by Scheduled Traffic at Critical Loading 1: The Critically Loaded S/D/1 Workload Converges to a Finite Limit If and Only If the Perturbations Are Bounded AboveResearch Paper

Many service systems do not receive random, memoryless traffic: customers are given appointments. Outpatient clinics, airport runways, container terminals and delivery slots all schedule arrivals on a regular grid, and the actual arrival deviates from the appointment by a random lateness or earliness. A queue fed by such scheduled traffic is a basic model…

14 thms2 active usersReviewed
Linear algebraOperations Research·Captain: mikedeng1

A Hierarchical Approach to Robust Stability of Multiclass Queueing Networks: Chen-S at Every Static-Priority Corner Implies Chen-S for Every Queue-Ratio PolicyResearch Paper

A multiclass queueing network routes jobs of several classes through shared stations. Whether such a network is stable depends on the scheduling policy and not only on the load: the Lu–Kumar and Rybko–Stolyar examples are unstable under a static-priority policy with every station loaded below capacity (Bramson, Stability of Queueing Networks, 2008). A…

10 thms2 active usersReviewed
Numerical AnalysisOperations ResearchProbability·Captain: mikedeng1

An Approximation to the Invariant Measure of the Limiting Diffusion of G/Ph/n + GI Queues in the Halfin–Whitt Regime and Related Asymptotics 1: Euler–Maruyama Error C_ς η^{(1−ς)/2} in Wasserstein-1Research Paper

Many-server queues are the basic model of call centres and hospital wards, and the Halfin–Whitt regime (the number of servers nnn grows while the traffic intensity approaches one at rate n−1/2n^{-1/2}n−1/2) is where such systems operate efficiently and with short delays. In this regime the centred and scaled queue process of a G/Ph/n+GIG/Ph/n+GIG/Ph/n+GI queue (general arrivals,…

18 thms2 active usersReviewed
Markov ChainOperations ResearchProbability·Captain: mikedeng1

An Approximation to the Invariant Measure of the Limiting Diffusion of G/Ph/n + GI Queues in the Halfin–Whitt Regime and Related Asymptotics 2: CLT for Occupation Measures With Variance µ(|σ′∇f|²)Research Paper

In a many-server queue with nnn servers, the Halfin–Whitt (quality-and-efficiency-driven) regime lets n→∞n\to\inftyn→∞ while the arrival rate approaches capacity at rate n\sqrt nn​. In this regime the centred and scaled number of customers in each service phase of a G/Ph/n+GIG/Ph/n+GIG/Ph/n+GI queue (general arrivals, phase-type service, general patience) converges to a ddd-dimensional…

16 thms2 active usersReviewed
Control TheoryOperations ResearchProbability·Captain: mikedeng1

Scheduling in the High-Uncertainty Heavy Traffic Regime: The Value of the Scheduling Game Converges to the HJB Solution at ZeroResearch Paper

Heavy-traffic analysis is the standard tool for scheduling queues whose servers are almost always busy: after diffusion scaling, a multiclass queue is approximated by a reflected Brownian motion, and asymptotically optimal policies are read off a limiting control problem. Classical results of this kind, such as the asymptotic optimality of the cµ rule (serve…

20 thms2 active usersReviewed
PreviousPage 17 of 26Next

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