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
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
🏆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
🏆Completed
Numerical AnalysisRandom Matrix Theory·Captain: tc

Gaussian Random Matrices II: Inverse Moments of the PseudoinverseTextbook

The expected error of the randomized SVD with a k×(k+p)k\times(k+p)k×(k+p) Gaussian test matrix is (1+kp−1)1/2\bigl(1+\tfrac{k}{p-1}\bigr)^{1/2}(1+p−1k​)1/2 times the optimal error (Halko–Martinsson–Tropp 2011, Theorem 10.5). The factor kp−1\tfrac{k}{p-1}p−1k​ is E∥G†∥F2\mathbb E\|G^{\dagger}\|_F^2E∥G†∥F2​ for a k×(k+p)k\times(k+p)k×(k+p) standard Gaussian matrix GGG: the quality of every Gaussian sketching method is governed by inve…

19 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStatistics·Captain: mikedeng1

Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation 2: Optimal Values and Solutions of the Smoothed SAA Converge w.p.1 as N → ∞ and ε → 0Research Paper

A chance-constrained program asks for a decision that satisfies uncertain constraints with high probability rather than surely:

10 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStatistics·Captain: mikedeng1

Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation 1: Smoothed Sample Feasible Sets Lie in the True Feasible Set with Probability ≥ 1 − ⌈1/β⌉⌈2LD/t⌉ⁿ exp(−2NM²)Research Paper

A chance-constrained program minimizes a cost f(x)f(x)f(x) over a closed set X⊆RnX\subseteq\mathbb R^nX⊆Rn subject to a constraint that must hold with high probability rather than surely:

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Dynamic Pricing in the Presence of Social Learning and Strategic Consumers 3: With Social Learning, Responsive Pricing Beats Pre-Announced Pricing When Consumers Are ImpatientResearch Paper

A recurring question in revenue management with strategic consumers is whether a seller gains from price commitment. When customers are forward-looking, a seller who announces its whole price path in advance (pre-announced pricing) removes the customers' incentive to wait for a markdown the seller would otherwise be tempted to give; a seller who keeps the…

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Dynamic Pricing in the Presence of Social Learning and Strategic Consumers 2: Under Responsive Pricing, Social Learning Raises Optimal Expected Profit When Consumers Are Impatient or PatientResearch Paper

A firm launching a new experience good does not know how good the product is, and neither do its customers. Early buyers post reviews, and customers who wait learn from them: this is social learning (SL). Forward-looking customers anticipate this and may delay their purchase until reviews are available, which cuts into the firm's early sales. Papanastasiou…

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

Distributionally Robust Joint Chance Constraints with Second-Order Moment Information II: Over Scaling Parameters, Worst-Case CVaR Is Essentially Exact for Joint Chance ConstraintsResearch Paper

A chance constraint asks that a decision x∈Rnx\in\mathbb R^nx∈Rn satisfy uncertain inequalities with high probability. In the setting of Zymler, Kuhn and Rustem (Math. Program. 137, 2013), mmm affine inequalities yi0(x)+yi(x)⊤ξ~≤0y_i^0(x)+y_i(x)^\top\tilde\xi\le0yi0​(x)+yi​(x)⊤ξ~​≤0, whose coefficients depend affinely on xxx, must hold jointly with probability at least 1−ϵ1-\epsilon1−ϵ. Joint chance constraints…

17 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Distributionally Robust Convex Optimization III: The Lifting Theorem — a Conic Bound on E[g(z̃)] Describes Exactly the z̃-Marginals of a Lifted Ambiguity SetResearch Paper

Distributionally robust optimization asks a decision to perform well against every probability distribution in an ambiguity set P\mathcal PP, a family of distributions consistent with partial information about an uncertain parameter z~∈RP\tilde z \in \mathbb R^Pz~∈RP. Which kinds of information an ambiguity set can encode decides which models a solver can handle.…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization II: Interchangeability Holds for Diagonally Dominant Functions iff Measurable Projection and Weak Selection DoResearch Paper

In Wasserstein distributionally robust optimization (DRO) a decision is evaluated against the worst distribution within an optimal-transport ball around a nominal distribution P^\widehat{\mathbb P}P. Every tractable reformulation rests on a strong duality theorem that replaces the supremum over distributions by a one-dimensional minimization over a multiplier …

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz Algorithm: SGD with Step γ < 1/sup L Has E‖x_k − x⋆‖² ≤ [1 − 2γμ(1 − γ sup L)]^k ‖x₀ − x⋆‖² + γσ²/(μ(1 − γ sup L))Research Paper

Stochastic gradient descent (SGD) minimizes an objective that is an expectation, F(x)=Ei∼Dfi(x)F(x) = \mathbb E_{i\sim\mathcal D} f_i(x)F(x)=Ei∼D​fi​(x), by stepping along the gradient of one randomly drawn component at a time. It is the workhorse of large-scale machine learning, where FFF is an average loss over training examples, and it also contains the randomized Kaczmarz method for…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization I: Worst-Case Loss = min over λ ≥ 0 of λρ + E[sup f − λc] for All ρ > 0 iff Interchangeability HoldsResearch Paper

Wasserstein distributionally robust optimization (DRO) hedges a decision against every probability distribution within a given transport distance of a nominal one, typically the empirical distribution of data. The inner problem, the worst-case loss, is an optimization over an infinite-dimensional set of measures, and every practical use of Wasserstein DRO —…

15 thms3 active usersReviewed
PreviousPage 23 of 62Next

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