Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Acquihiring for Monopsony Power 3: With a Uniform Private Benefit on [0, B], the Acquirer Acquihires Exactly When v_a > v_s + (7 − 3√5)B/2 and Otherwise Hires DirectlyResearch Paper

Large technology firms often buy small startups mainly to hire their staff, a practice known as acquihiring. Antitrust authorities review acquisitions that may reduce competition in product markets, but an acquihire can instead reduce competition in the labour market: a firm that buys the employer of a scarce worker no longer has to outbid that employer for…

7 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Reducing Marketplace Interference Bias Via Shadow Prices 2: In Expectation the Shadow-Price Estimator Equals the Derivative of the Finite-Sample Partial-Treatment Value FunctionResearch Paper

Two-sided platforms (ride hailing, delivery, freight, cloud capacity) test product changes with user-split experiments: each arriving demand unit is assigned to treatment with probability ρ\rhoρ and to control otherwise. Treated and control units then compete for the same supply, so the outcome of one group depends on the size of the other. This interference b…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimal Transport·Captain: mikedeng1

Global Sensitivity Analysis via Optimal Transport 1: An OT-Based Sensitivity Measure Is Maximal Exactly When the Output Is a Function of the InputResearch Paper

Global sensitivity analysis asks how much of the uncertainty in the output YYY of a model, a simulator or a learned predictor is attributable to an input XXX. A standard way to answer is to compare the law of YYY with its law after XXX is revealed, and to average that discrepancy over XXX. Variance-based indices (Sobol' 1993; Wagner 1995) compare conditional and…

11 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Simple and Explicit Bounds for Multiserver Queues with 1/(1−ρ) Scaling: With More Than 2.5 Finite Service Moments, GI/GI/n Steady-State Queue Tails and Delay Probability Obey Explicit BoundsResearch Paper

Multi-server queues model call centres, hospital wards, cloud server pools and any system in which nnn identical servers work through one first-come-first-served (FCFS) line. Capacity planning for such systems needs bounds on the steady-state queue length and on the probability of delay (the chance that an arriving job finds every server busy) that are…

17 thms3 active usersReviewed
Operations ResearchOptimizationPartial Differential Equations·Captain: mikedeng1

Optimality Conditions in Control Problems with Random State Constraints in Probabilistic or Almost Sure Form II: Explicit Optimality Conditions for Probabilistic Elliptic PDE State ConstraintsResearch Paper

Optimal control of partial differential equations under uncertainty arises whenever a physical system is steered by a control while its sources, coefficients or loads are only known in distribution. A typical requirement is a state constraint: the state (a temperature, a concentration, a displacement) must stay below a threshold everywhere in the domain.…

23 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research·Captain: mikedeng1

Thompson Sampling with Information Relaxation Penalties II: The IRS Performance Bounds Are Monotone, W^TS ≥ W^IRS.FH ≥ W^IRS.V-Zero and W^TS ≥ W^IRS.V-EMaxResearch Paper

In a Bayesian multi-armed bandit a decision maker pulls one of KKK arms in each of TTT periods, observes the reward, and updates a prior belief about each arm's unknown parameter. The best achievable expected total reward, V∗(T,y)V^*(T, y)V∗(T,y), is the value of a dynamic program over beliefs, and for all but the smallest instances it cannot be computed. Upper bounds on V∗V^*V∗…

9 thms3 active usersReviewed
Operations ResearchStatistics·Captain: mikedeng1

Achieving Efficiency in Black-Box Simulation of Distribution Tails with Self-Structuring Importance Samplers: The Self-Structuring Importance Sampler Is Logarithmically EfficientResearch Paper

Many operational risk questions ask for a small probability pu=P(L(X)≥u)p_u=P(L(X)\ge u)pu​=P(L(X)≥u): the chance that the cost LLL of a decision, evaluated at a random scenario X∈RdX\in\mathbb R^dX∈Rd, exceeds a large threshold uuu. Examples are large delays in project networks or vehicle routing, large portfolio credit losses, and failures in engineered systems. Plain Monte Carlo needs on…

17 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 2: With Zero Lead Time and Minimal Disposal, Two Myopic Solutions Bound the Optimal Order-Up-To LevelResearch Paper

Food, blood products, pharmaceuticals and many retail goods are perishable: a unit is usable for a fixed number of periods and is then discarded. A seller of such a product decides every period how much to order, what price to charge, and how much stock to deplete or dispose of. Because units of different ages coexist, the state of the system is a vector of…

10 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: mikedeng1

Corruption-Robust Exploration in Episodic Reinforcement Learning II: Uniformly Action-Eliminating Algorithms Suffer Expected Regret at Least K/8 for K ≤ A^H/4Research Paper

In stochastic multi-armed bandits, a robust way to explore is action elimination: keep confidence intervals for every arm, discard an arm once its upper confidence bound falls below another arm's lower confidence bound, and sample uniformly among the arms that survive. Uniform sampling is what makes the first corruption-robust bandit algorithm work (Lykouris…

10 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 1: With Backlogging, the Profit-to-Go Is L♮-Concave and the Optimal Policy Is Monotone with Bounded SensitivityResearch Paper

Food, blood and pharmaceuticals are perishable: a unit not sold within its lifetime is thrown away. A seller decides each period how much to order, which price to charge, and whether to dispose of stock early. A large stock of old units argues for a lower price and a smaller order.

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming: Individual Chance Constraints over Markov Ambiguity Sets Are Finite Conic SystemsResearch Paper

Many engineering and operations problems must guarantee that a system operates safely with high probability, when the uncertain parameters z~\tilde zz~ are only partially known. A chance constraint asks that the safety condition Sz~≤tS\tilde z \le tSz~≤t hold with probability at least 1−ϵ1-\epsilon1−ϵ for a tolerance ϵ∈(0,1)\epsilon \in (0,1)ϵ∈(0,1). When the distribution of z~\tilde zz~ is…

9 thms3 active usersReviewed
Operations Research·Captain: LG

Symmetric Rendezvous on the LineOpen Problem

Rendezvous search asks how two agents who cannot communicate should move so as to meet as quickly as possible. It was introduced as a mathematical problem by Alpern (The rendezvous search problem, SIAM J. Control Optim. 1995) and developed systematically in Alpern and Gal's monograph The Theory of Search Games and Rendezvous (Kluwer, 2003). Besides its…

9 thms3 active usersReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics XC: Structural Corporate Default and Rating-Migration Credit ValuationTextbook

Credit risk matters to insurer bond holdings, pension scheme fixed-income investment and counterparty guarantees. Merton's corporate debt model derives terminal shareholder and bondholder payoffs from limited liability and asset value. Jarrow–Lando–Turnbull introduces observable ratings with Markov state migrations and default, motivating a second,…

48 thms3 active usersReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics LXXXIX: Expected Utility, Certainty Equivalents and Stochastic Risk OrdersTextbook

Insurance economics prices risk using the utility of wealth rather than merely its variance. Pratt's seminal work derives risk aversion and the certainty-equivalent insurance premium, while Rothschild and Stiglitz connect comparative risk to probability order. Earlier actuarial entropic premium missions contain special finite retention objectives but do not…

46 thms3 active usersReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics XCI: Joint-Life Mortality Profit and Contingent Survivor BenefitsTextbook

Mortality experience in joint-life assurance and pensions depends not only on whether someone died, but on which insured life survives and which survivor or joint reserve must then be held. Standard multiple-life actuarial valuations motivate last-survivor, reversionary and guaranteed pension benefits. Earlier actuarial missions XLV and XLVI treat basic…

54 thms3 active usersReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics LXXVII: Compound Aggregate Masses and the Full Finite Panjer RecursionTextbook

Panjer's original 1981 result derives the aggregate claims recursion from a special frequency probability law and arbitrary nonnegative-integer severity mass distribution, including claims worth zero. The original article and the Sundt–Jewell extension underpin the mission. Earlier actuarial mission LIV handles direct recurrence algebra, while LXXIII…

58 thms3 active usersReviewed
🏆Completed
Partial Differential EquationsStochastic Systems·Captain: LG

Black–Scholes Model: Pricing Formula, PDE and GreeksTextbook

The Black–Scholes model (Black and Scholes, 1973; Merton, 1973) is the reference model for pricing European options. Its closed-form price, the Black–Scholes formula, is quoted daily by options markets, its partial derivatives (the Greeks) are the standard risk measures that trading desks limit and hedge, and the Black–Scholes equation is the prototype of…

42 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Prophet Secretary Through Blind Strategies 2: No Stopping Strategy Can Guarantee More Than √3 − 1 of the Prophet's Expected Maximum in Random OrderResearch Paper

In a prophet inequality a gambler sees the realizations of independent nonnegative random variables one at a time and must decide irrevocably, at each step, whether to stop and keep the current value. Her performance is compared with that of a prophet who sees everything in advance and takes the maximum. The ratio between the two is the standard benchmark…

8 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamic ProgrammingOperations Research+1·Captain: mikedeng1

On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs 2: Under τ-Admissible Random Node Selection, Cuts Become Exact Almost Surely at Every Tree NodeResearch Paper

Stochastic dual dynamic programming (SDDP) and its relatives are the standard algorithms for multistage stochastic programs: hydro-thermal scheduling, energy storage and long-horizon capacity planning are solved with them in industry. They approximate each future cost function from below by a maximum of affine cuts, compute new cuts only at a few randomly…

16 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures IV: The Comonotonic Inf-Convolution of Tail Risk Measures Is a Tail Risk Measure with the Maximal Tail ParameterResearch Paper

A risk sharing problem distributes an aggregate random loss XXX among nnn agents, each of whom evaluates its share with a risk measure ρi\rho_iρi​. The smallest achievable aggregate risk is the inf-convolution □i=1nρi(X)\square_{i=1}^n\rho_i(X)□i=1n​ρi​(X), and allocations that attain it are optimal. In insurance and in regulated banking the allocation is often required to be comonotonic:…

7 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures III: The Inf-Convolution of Tail Risk Measures Is a Tail Risk Measure with the Summed Tail ParameterResearch Paper

A risk measure assigns a number, typically a capital requirement, to a random financial loss. When a total loss XXX is shared among nnn agents, each judging its share by its own risk measure ρi\rho_iρi​, the smallest achievable aggregate risk is the inf-convolution

7 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Online Stochastic Matching: New Algorithms with Better Bounds 1: Every Random-Lists Algorithm Has ALG/OPT ≥ E[ALG]/E[OPT] − 2ε/(c+ε) with Probability at Least 1 − 2exp(−2nε²)Research Paper

Online bipartite matching with stochastic arrivals models the assignment of display-advertising impressions to advertisers: requests arrive one at a time, each must be assigned irrevocably on arrival or dropped, and the arrival sequence is random rather than adversarial. Since Feldman, Mehta, Mirrokni and Muthukrishnan beat the 1−1/e1 - 1/e1−1/e barrier in the i.i.d.…

5 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures II: The Inf-Convolution of a VaR and a Monetary Tail Risk Measure, Its Optimal Allocation and Its Tail ParameterResearch Paper

Banks and insurers hold capital against the risk of their positions, and regulators compute that capital with a risk measure, a functional that maps a random loss to a number. The two standard ones are the Value-at-Risk (VaR), a quantile of the loss, and the Expected Shortfall, an average of the upper quantiles (BCBS 2019). Both look only at the upper tail…

7 thms3 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures I: The Inf-Convolution of Left and Right VaRs Is a VaR at the Summed Level, with an Explicit Optimal AllocationResearch Paper

Value-at-Risk (VaR) is the quantile-based capital requirement written into banking and insurance regulation (Basel, Solvency II). When several institutions, desks or subsidiaries each hold capital according to their own VaR, a natural question is how a total loss XXX should be split among them so that the aggregate capital is as small as possible. This is the …

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

The Bayesian Prophet: A Low-Regret Framework for Online Decision Making: Constant Regret of the Fluid Bayes Selector for the Multi-Secretary ProblemResearch Paper

In online allocation, requests arrive one at a time and each must be accepted or rejected on arrival, using a limited budget of resources. Revenue management, ad allocation and hiring all fit this pattern. A natural benchmark for an online policy is the prophet, or Offline: the decision maker who sees the whole arrival sequence in advance and acts optimally…

9 thms3 active usersReviewed
PreviousPage 38 of 110Next

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