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
CombinatoricsDiscrete GeometryTheoretical Computer Science·Captain: iris

Robust Exact Realization of Pairwise Boolean StatisticsResearch Paper

Suppose a data set consists of distinct binary rows of length nnn. Its basic statistics are the number of rows, each column sum, and each pairwise co-occurrence count. Given integer values for these statistics, can a set of rows be constructed that realizes them exactly? Equivalently: given the degree-at-most-two statistics of a Boolean function, construct a…

25 thms5 active usersReviewed
Complexity TheoryOperations Research·Captain: iris

Impatience Makes Matching NP-HardResearch Paper

Ride-hailing platforms, online labour marketplaces, organ-allocation systems and quantum switches all match two sides of a market whose agents do not wait forever. The standard abstraction is a bipartite queueing system: agents of finitely many types arrive over time, the platform decides which compatible pairs to match, and an unmatched agent leaves when…

32 thms5 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization·Captain: iris

Markov Decision Processes with Applications to Finance IX: Multiperiod Indifference Prices under Exponential Utility Are Given by a Backward RecursionTextbook

In a complete market every contingent claim has one arbitrage-free price, the cost of replicating it. When part of the risk sits in an asset that cannot be traded, replication fails and arbitrage arguments leave an interval of prices. Indifference pricing selects a price from the seller's preferences: the price at which an investor with a given utility…

31 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: iris

Markov Decision Processes with Applications to Finance IV: A One-Period Market Has an Optimal Portfolio for Every Wealth If and Only If It Admits No ArbitrageTextbook

Every portfolio problem in discrete-time mathematical finance starts from a market model and asks two questions: is the market free of arbitrage, and does an investor with a given utility function have an optimal portfolio? The two questions are linked. If a riskless strategy with a chance of gain exists, an investor with strictly increasing utility can…

23 thms5 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization·Captain: iris

Markov Decision Processes with Applications to Finance I: Under the Structure Assumption the Value Functions Solve the Bellman Equation and Every Sequence of Maximizers Is an Optimal PolicyTextbook

Sequential decisions under uncertainty appear in inventory control, portfolio choice, consumption planning and optimal stopping. The common model is the Markov Decision Model: a controller observes a state, picks an action, collects a reward, and the system moves at random to a new state. The standard solution method, backward induction, goes back to…

29 thms5 active usersReviewed
Operations ResearchTheoretical Computer Science·Captain: iris

Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders: Algorithm 1 Is a (1+ln⁡q)(1 + \ln q)(1+lnq)-Competitive Rounding Scheme with Runtime O(qK)O(qK)O(qK)Research Paper

An online retailer that holds inventory in many fulfillment centres (FCs) decides, for each item of an order, where to ship it from. A linear program solved over all orders gives, for each item, a probability distribution over FCs that is right on average. The difficulty is correlation: items sent to different FCs ship in separate packages, so an order is…

22 thms5 active usersReviewed
Operations ResearchStatistics·Captain: iris

Optimal Impact Portfolios with General Dependence and Marginals: induced order statistics equal g(U_{i:N}, V_i) in law for every N if and only if the copula is linearly interpolatingResearch Paper

An impact investor ranks NNN assets by an observable impact factor XiX_iXi​ (an ESG score, a carbon intensity) and puts weight wiw_iwi​ on the asset whose score ranks iii-th. What the portfolio earns is then driven by the vector of induced order statistics (also called concomitants) θ[X]=(θ[1:N],…,θ[N:N])\theta_{[X]} = (\theta_{[1:N]}, \dots, \theta_{[N:N]})θ[X]​=(θ[1:N]​,…,θ[N:N]​): θ[i:N]\theta_{[i:N]}θ[i:N]​ is the residual…

35 thms5 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: iris

Approximately Stationary Bandits with Knapsacks: Algorithm 1 Earns ρ+σr(σc−ρ)+\rho + \sigma_r(\sigma_c - \rho)^+ρ+σr​(σc​−ρ)+ of OPTFD\mathrm{OPT}_{FD}OPTFD​ Against Adaptive (σr,σc)(\sigma_r, \sigma_c)(σr​,σc​)-Stationary AdversariesResearch Paper

In Bandits with Knapsacks (BwK) a player repeatedly picks one of KKK actions; each choice yields a reward and consumes ddd limited resources, and play stops as soon as a budget runs out. The model covers dynamic pricing with limited inventory, ad auctions with a spending cap and crowdsourcing with a payment budget (Badanidiyuru, Kleinberg, Slivkins 2018). Its…

17 thms5 active usersReviewed
Algorithmic Game TheoryMachine LearningOperations Research·Captain: iris

On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning: Mean-Based Monotonic Play Cannot Converge Almost Surely to the Nash Equilibrium of a Competitive 2×2 GameResearch Paper

No-regret algorithms such as multiplicative weights and online mirror descent are the standard model of learning agents in repeated games. A classical fact is that when two such agents play a zero-sum game, the time-average of their mixed strategies converges to a Nash equilibrium (Freund and Schapire, 1999), and in general games the average play converges…

18 thms5 active usersReviewed
Machine LearningOperations ResearchStatistics·Captain: iris

Smooth Nested Simulation: Bridging Cubic and Square Root Convergence Rates in High Dimensions: KRR Nested Expectation Error Is O_P(Γ^{-1/2}) if ν ≥ d/2 and O_P(Γ^{-(2ν+d)/(2ν+3d)}) if ν < d/2Research Paper

Nested simulation estimates a quantity of the form θ=T(E[Y∣X])\theta=\mathcal T(\mathbb E[Y\mid X])θ=T(E[Y∣X]): an outer random scenario XXX (for example the state of a market at a risk horizon) and, for each scenario, an inner random quantity YYY (for example the discounted payoff of a portfolio) whose conditional mean f(x)=E[Y∣X=x]f(\mathbf x)=\mathbb E[Y\mid X=\mathbf x]f(x)=E[Y∣X=x] has no closed form.…

27 thms5 active usersReviewed
Operations ResearchOptimization·Captain: Shuze Chen

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?: A fully polynomial approximation scheme for cardinality-constrained assortmentsResearch Paper

Which products should a retailer offer when customers can choose at most one product or leave without buying? The answer depends on how products compete for a customer's attention. Offering another product can change the demand for every product already available. A choice model therefore determines both the revenue objective and the mathematical difficulty…

20 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection: Offering all products first earns 87.8 percent of optimumResearch Paper

A retailer that recommends products over several screens faces two decisions: which products to show at each stage, and what prices to charge. Customers may buy before seeing later offers, or leave without viewing the complete sequence. A revenue comparison must therefore account for the order of offers and the customer's willingness to continue browsing. Ga…

18 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Robust Optimization IX: Safe Matrix Chance ConstraintsTextbook

A semidefinite constraint asks whether a symmetric matrix is positive semidefinite: every vector must have a nonnegative quadratic form under that matrix. In optimization, its entries can depend on a decision and on uncertain inputs. Requiring the constraint for every possible input can be restrictive, especially when rare inputs have very large magnitude.…

8 thms5 active usersReviewed
Bandit AlgorithmsOperations ResearchOptimization·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices VII: Freezing Rules, Forwards Induction and the Near-Optimality of ε-Index* PoliciesTextbook

A multi-armed bandit in the sense of Gittins is a sequential allocation problem: several independent Markov reward processes compete for a single resource, at each decision time exactly one of them is operated, and the goal is to maximize the expected total discounted reward. The Gittins index theorem says that it is optimal to operate, at every decision…

11 thms5 active usersReviewed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization: NASA with Stepsizes 1/√N Drives the Expected Stationarity Measure E[V(x_R, z_R)] Below C/(√N − 1)Research Paper

Many learning and risk-averse decision problems minimize a function of an expectation that is itself passed through another function: F(x)=f(g(x))F(x)=f(g(x))F(x)=f(g(x)) with g(x)=E[G(x,ξ)]g(x)=\mathbb E[G(x,\xi)]g(x)=E[G(x,ξ)]. Examples are mean–deviation risk measures, stochastic variational inequalities rewritten as minimization, and policy evaluation in reinforcement learning. Only noisy samples of ggg,…

15 thms5 active usersReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 7: For c = |y − x| and Continuous µ the Optimizer Is Unique, Keeps µ ∧ ν in Place, Splits the Rest in TwoResearch Paper

A martingale transport plan between two laws μ\muμ and ν\nuν on R\mathbb RR is a joint law of a pair (X,Y)(X,Y)(X,Y) with X∼μX\sim\muX∼μ, Y∼νY\sim\nuY∼ν and E[Y∣X]=XE[Y\mid X]=XE[Y∣X]=X. Minimizing or maximizing E[c(X,Y)]E[c(X,Y)]E[c(X,Y)] over such plans gives the model-independent price bounds of an option with payoff c(X,Y)c(X,Y)c(X,Y) when the market quotes vanilla options at two maturities, and so fixes the marginal laws μ\muμ…

19 thms5 active usersReviewed
AnalysisOperations ResearchStochastic Systems·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 3: Rate of Approach — t^κP(R > t) Equals C₊ Minus a Contour Integral Plus O(t^{−β/2})Research Paper

Random equations of the form R=LΨ(R)R \overset{\mathcal L}{=} \Psi(R)R=LΨ(R), with Ψ\PsiΨ a random function independent of RRR, describe the stationary laws of many stochastic recursions: perpetuities in insurance and finance, the stationary law of ARCH-type volatility models, random difference equations R=Q+MRR = Q + MRR=Q+MR, and the stationary workload of certain queueing and storage…

17 thms5 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 2: Kesten's Theorem for R = Q + MR — Unique Stationary Law, Power Tails with Explicit C±, and C₊ + C₋ > 0 iff Q ≢ (1 − M)cResearch Paper

The random difference equation

16 thms5 active usersReviewed
Complexity TheoryInformation TheoryTheoretical Computer Science·Captain: mikedeng1

A Pseudorandom Generator from Any One-Way Function: One-Way Functions Exist If and Only If Pseudorandom Generators ExistResearch Paper

Cryptographic protocols use random looking strings that can be reproduced from a shorter private seed. A pseudorandom generator provides those strings if no efficient observer can tell them from uniformly sampled bits. A one-way function provides a different kind of asymmetry: anyone can evaluate it efficiently, but no efficient algorithm can usually…

21 thms5 active usersReviewed
Bandit AlgorithmsDynamic ProgrammingOperations Research·Captain: mikedeng1

Bandit Processes and Dynamic Allocation Indices: A Policy Is Optimal If and Only If It Almost Surely Continues a Bandit Process of Maximal Dynamic Allocation IndexResearch Paper

The multi-armed bandit problem asks how to share effort sequentially among several independent projects, each of which evolves only while it is worked on. It models the scheduling of jobs on a single machine, the order in which to explore candidate sites, sequential clinical trials and the allocation of research effort among competing projects. Before 1972…

8 thms5 active usersReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 2: Lévy–Itô Decomposition and Path StructureTextbook

A Lévy process is a stochastic process whose increments are stationary and independent and whose sample paths have right limits and left limits. It unifies Brownian fluctuations, isolated jumps and infinitely many small jumps in a single model. This structure is useful in insurance risk, quantitative finance, queuing systems and the fluctuation identities…

74 thms4 active usersReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 5: Subordinators at First Passage and Renewal MeasuresTextbook

A subordinator is a non-decreasing Lévy process, and its renewal measure records the accumulated occupation of levels. Together they provide a fundamental route to understanding first-passage times, overshoots and undershoots of jump processes. The principal motivation is Chapter 5 of Andreas E. Kyprianou's 2006 first-edition textbook, which gives a unified…

66 thms4 active usersReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 4: General Storage Models and Paths of Bounded VariationTextbook

General storage models turn a net-input path into a nonnegative workload by a minimal Skorokhod regulator. In Chapter 4 of Andreas E. Kyprianou, Introductory Lectures on Fluctuations of Lévy Processes with Applications (Springer Universitext, first edition, 2006, printed pp. 87–109), this construction connects idle time, bounded-variation Lévy processes,…

79 thms4 active usersReviewed
Stochastic Systems·Captain: WillR

Kyprianou (2006), Chapter 3: More Distributional and Path-Related PropertiesTextbook

Levy processes are continuous-time models with stationary independent increments that allow both diffusion and jumps. The structure developed by Andreas E. Kyprianou in Chapter 3 of his 2006 textbook is used in fluctuation theory, first-passage calculations, storage models, and insurance ruin models. The chapter starts with the behaviour of paths at random…

117 thms4 active usersReviewed
Reinforcement LearningStatistics·Captain: iris

When Can Physical Evidence Survive a World-Model Update? Finite-Cost Re-Auditing and Reusable Policy CertificatesResearch Paper

Learned world models let a controller propose new policies after every update of an encoder, a simulator or a planner, without collecting any new physical data. When the physical dynamics themselves change, old evidence no longer certifies anything about the new environment, and fresh interaction is needed. Fresh interaction is expensive in a specific way:…

25 thms4 active usersReviewed
PreviousPage 2 of 48Next

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