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 Research·Captain: Shuze Chen

Distributionally Robust Markov Decision Processes: S-robust strategies are distributionally optimal and admit a saddle pointResearch Paper

A planner who controls a stochastic system often knows more than a range of possible transition probabilities, but less than a complete probability distribution for those probabilities. For example, a small confidence region may contain a parameter with probability at least 90%, while a larger region contains it with certainty. Optimizing against every…

10 thms3 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: WillR

MarkovProcess: Verified Library Import and Continuous-Path ExistenceResearch Paper

Import Scott Armstrong's existing Lean 4 MarkovProcess formalisation into Prove2Me as individually reusable, remotely verified declarations. Preserve the upstream statements, complete proof terms, source citations and Apache-2.0 attribution.

731 thms3 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: WillR

Itô Calculus II: Product Rule, Quadratic Variation and Stochastic ExponentialsTextbook

The first Prove2Me Itô's lemma mission established the time-dependent scalar stochastic chain rule under explicit regularity and integrability assumptions. Itô calculus II develops its structural consequences: products of correlated Itô processes, quadratic covariation, Brownian squares, integration by parts, stochastic exponentials and geometric Brownian…

23 thms3 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: WillR

Itô's Lemma: Brownian Motion, Quadratic Variation and the Stochastic Chain RuleTextbook

Itô's lemma is the stochastic chain rule. It identifies the additional drift created when a nonlinear function is applied to a process with Brownian fluctuations. This second-order correction is central to stochastic differential equations, martingales and mathematical finance. The Wikipedia article discusses the scalar formula, multidimensional and jump…

23 thms3 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

On the Closest String and Substring Problems: A Random-Sampling PTAS for Closest Substring, Within Factor 1 + 1/(2r−1) + 3εr of Optimal with Probability 1 − 2(nm)^(−1/3)Research Paper

Many tasks in computational biology ask for a short pattern that occurs, with few errors, in each of a family of DNA or protein sequences: locating binding sites, finding conserved regions in unaligned sequences, designing PCR primers and genetic probes, and searching for a drug sequence that binds to a set of pathogen genomes. With Hamming distance as the…

13 thms3 active usersReviewed
Mechanism DesignOperations ResearchStochastic Systems·Captain: mikedeng1

Driver Surge Pricing: Prices m_iτ + z_i q_{i→j}(τ) Make Accepting Every Trip the Unique Optimal Driver Policy When R1/R2 ∈ (C, 1), and Accepting All Surge Trips Optimal for Every R1 < R2Research Paper

Ride-hailing platforms pay drivers per trip, and drivers are free to decline requests. When demand fluctuates, a trip accepted now also decides where and when the driver will be free next. During a surge (a period of high demand and high pay) a long trip keeps a driver busy after the surge may have ended, so a driver may rationally decline trips the…

20 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration: Fluctuation Identities for Branching Processes with ImmigrationResearch Paper

A Markov branching process with immigration (MBI) models a population in continuous time: each individual independently dies, splits or is removed at affine rates, and batches of immigrants arrive at a constant rate. Such processes appear in population biology, queueing (infinite-server systems with batch arrivals), epidemics and the analysis of branching…

20 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

Large Independent Sets in Recursive Markov Random Graphs: For Every r < 1 and ε > 0, With High Probability α(G^r_{n,p}) ≥ ((1 − r)/(2 + ε))·n/log nResearch Paper

The stability number α(G)\alpha(G)α(G) of a graph, the largest number of pairwise non-adjacent vertices, is one of the basic parameters of combinatorial optimization: computing it is NP-hard, and random graphs are the standard test bed for what typical instances look like. For the Erdős–Rényi–Gilbert graph Gn,pG_{n,p}Gn,p​, in which every edge is present independently, the…

17 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: mikedeng1

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems: Dispatching to One Remembered Server, Updated by Queue-Length Messages, Is Stable for Every Vector of Server RatesResearch Paper

A central dispatcher that routes jobs to parallel servers is the basic model behind web server farms, cloud schedulers and call centers. When the servers have different speeds, and the speeds are not known to the dispatcher, two classical policies behave very differently. Random routing is cheap but unstable as soon as some server is slower than the average…

8 thms3 active usersReviewed
Machine LearningOperations Research·Captain: mikedeng1

The Secretary Problem with Predictions: Learned Dynkin Is max{0.215, (1−ε)/(1+ε)}-CompetitiveResearch Paper

The secretary problem asks how to hire the best of nnn candidates who are interviewed one at a time in random order, when every hiring decision must be made irrevocably at the interview. It is the standard model of online selection under uncertainty, and its answer, Dynkin's rule, hires the maximum with probability 1/e1/e1/e (Dynkin 1963; see the survey of Ferguson…

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

The Fragility of Optimized Bandit Algorithms: Optimized Bandit Algorithms Have Truncated Cauchy Regret TailsResearch Paper

The stochastic multi-armed bandit is the basic model of sequential decision-making under uncertainty: in each round an algorithm chooses one of KKK arms, observes a random reward from that arm's distribution, and tries to play the best arm as often as possible. Since Lai and Robbins (1985) the standard of quality has been the expected regret, and an algorithm…

14 thms3 active usersReviewed
CombinatoricsLinear OptimizationOperations Research+1·Captain: mikedeng1

Improved Guarantees for the A Priori TSP: Random Sampling with Probability 1 − (1 − p)^0.663 and a 3/2-Approximate Master Tour Has Approximation Guarantee Below 3.1 on Instances with a DepotResearch Paper

In the a priori traveling salesman problem with independent activation, a tour through all customers must be fixed before it is known which customers need a visit; each customer is active independently with a known probability, and the fixed tour is afterwards cut short to the active ones. The model, introduced by Jaillet and by Bertsimas as the…

19 thms3 active usersReviewed
Markov ChainReinforcement LearningStatistics·Captain: mikedeng1

Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity: Under Geometric Mixing the Empirical Estimator Is ε-Accurate After Order dT/ε² Samples, and This Rate Is MinimaxResearch Paper

Offline reinforcement learning and off-policy evaluation start from a single logged trajectory of a controlled system. The policy that generated the log is often unknown, history-dependent and not stationary. Model-based methods first estimate the transition probabilities of the system from this log, then plan or evaluate policies in the estimated model (Aga…

14 thms3 active usersReviewed
🏆Completed
Quantum Information·Captain: mikedeng1

Floating Point Representations in Quantum Circuit Synthesis: Exact Mean and Variance Bound for the Number of U and U† Applications in the Composed Gearbox CircuitResearch Paper

Fault-tolerant quantum computers implement Clifford gates cheaply and the non-Clifford T gate expensively, because T gates are obtained by magic-state distillation (Fowler, Stephens and Groszkowski). Single-qubit rotations by small, arbitrary angles appear throughout quantum simulation and must be compiled into Clifford+T circuits, so the T-count of a small…

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

Distribution-Free Pricing: Knowing Only the Mean and Variance, the Price μ − k*σ Is Maximin-Optimal and Earns a Fraction ρ of the Optimal ProfitResearch Paper

A seller who posts a single price ppp for a product with marginal cost ccc earns (p−c)(p-c)(p−c) from every customer whose valuation is at least ppp. Choosing ppp well requires the distribution of valuations, which in practice is rarely known: a new product, a new market, or a short sales history typically yields an estimate of the mean and the spread of willingness to pay,…

10 thms3 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Pricing with Samples: Posting 0.76 Times a Single Sample Earns at Least 64% of the Optimal Revenue Against Every Monotone Hazard Rate DistributionResearch Paper

A seller who knows the distribution FFF of a buyer's value can post the revenue-maximizing price. In practice the seller rarely knows FFF; often it has only a handful of past observations. Pricing with samples asks how much revenue such data can guarantee: the seller sees NNN independent draws from FFF, posts a price that depends on them, and is judged by the…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Lagrangian Inference for Ranking Problems: Asymptotic Normality of the Lagrangian Debiased EstimatorResearch Paper

Ranking from pairwise comparisons is used in sports ratings, recommendation systems, crowdsourcing and web search. The most widely used parametric model is the Bradley–Terry–Luce (BTL) model (Bradley and Terry 1952; Luce 1959), in which item kkk carries a score θk\theta_kθk​ and item iii beats item jjj with probability eθi/(eθi+eθj)e^{\theta_i}/(e^{\theta_i}+e^{\theta_j})eθi​/(eθi​+eθj​). The…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Monte Carlo Estimation of CoVaR: Asymptotic Normality and the n^(-1/3) Rate of the Batching EstimatorResearch Paper

CoVaR is the measure of systemic risk proposed by Adrian and Brunnermeier (AER 2016): the β-quantile of one institution's loss YYY given that another loss XXX (a bank, a market index) sits exactly at its own α-quantile, its value-at-risk. Regulators and risk managers compute it from simulation models of portfolios, where the joint law of (X,Y)(X, Y)(X,Y) is available…

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

Optimal Prototyping with Noisy Measurements: A Fidelity-Adjusted Reservation Price Policy Is Optimal for Sequential Search with Noisy EvaluationsResearch Paper

Product development is often organized as a search over prototypes: several candidate designs exist, each must be built or tested at a cost before its quality is known, and the firm wants to end up launching the best one without spending too much on testing. When each test reveals the true quality of a prototype, this is Pandora's box problem, solved by…

7 thms3 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Sales-Based Rebate Design: No Increasing Sales-Based Reward Program Is ProfitableResearch Paper

Products with positive network effects (messaging apps, online games, social platforms) are known to support higher profits: a buyer's utility grows with the number of other buyers, and a seller can monetize that complementarity (Katz and Shapiro 1986; Candogan, Bimpikis and Ozdaglar 2012). Ajorlou and Jadbabaie ask whether a seller of a product without such…

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

Incentive-Compatible Forecasting Competitions: the Independent-Event Lotteries mechanism is strictly incentive compatible under belief independence and limit accurate for independent eventsResearch Paper

Forecasting competitions ask many forecasters to report probabilities for many future binary events and award a single prize to one of them. They are used to identify and reward accurate forecasters: the Good Judgment Project gave "superforecaster" status to the top 2% by quadratic score, and data-science platforms run similar leaderboards. The usual rule…

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

Portfolio Optimization Based on Almost Second-Degree Stochastic Dominance: Approximate ASSD Under a Discretization Scheme Implies ASSDResearch Paper

Second-order stochastic dominance (SSD) is the standard ordering of risky prospects for risk-averse investors: a return XXX dominates a return YYY by SSD when every investor with a nondecreasing concave utility weakly prefers XXX. Portfolio models that require a chosen portfolio to dominate a benchmark by SSD go back to Dentcheva and Ruszczyński (2003) and are…

8 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Can a Supplier’s Yield Risk Be Truthfully Communicated via Cheap Talk?: Truthful Yield Reporting Is an Equilibrium Iff Expected Market Potentials Bracket the Adjusted Wholesale RateResearch Paper

A firm that outsources a new product or component to a supplier with an immature production process faces random yield: only a random fraction of the input becomes a usable unit. In semiconductor manufacturing, for instance, yield losses on new-generation chips have been reported at 30–45%. The supplier usually knows her own yield better than the buyer…

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

Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper

Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…

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

Tracking Truth with Liquid Democracy: Upward Delegation Satisfies Probabilistic Do No Harm and Positive GainResearch Paper

Liquid democracy lets each voter either vote directly or delegate the vote to another voter, who may delegate it further. It has been used in practice, for example by the German Pirate Party on the LiquidFeedback platform and in the Google Votes experiment, and has been studied in computational social choice as a way to give more weight to better-informed…

13 thms3 active usersReviewed
PreviousPage 32 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