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
Operations ResearchStochastic Systems·Captain: iris

Diffusion Limit of Fair Resource Control: Under Aθ < 0 and Bounded Workload, Stationary Workloads Converge to the Diffusion Limit's Stationary Law, with Moments of Order m < p − 1Research Paper

Bandwidth-sharing networks model data transfers that each occupy several links of a communication network at once. Under proportional fair (PF) allocation, introduced by Kelly, Maulloo and Tan (J. Oper. Res. Soc. 1998), the capacity of the links is split among the active transfers by maximizing a weighted sum of logarithms. Exact steady-state distributions…

21 thms3 active usersReviewed
Markov ChainOperations ResearchStatistics·Captain: iris

Unbiased Time-Average Estimators for Markov Chains: the Debiased Estimator f̂ₖ Is Unbiased and Square-Integrable with T̂ₖVar(f̂ₖ) ≤ kVar(fₖ) + 8610ν̄(0)²max(q, √((b′(k)−b(k))/k))Research Paper

Steady-state means of Markov chains are estimated by simulation throughout operations research and statistics: queue lengths and waiting times in stochastic networks, posterior expectations in Markov chain Monte Carlo, volumes of convex bodies. The standard estimator is a time average of one long run after a burn-in period. It is biased, because the chain…

31 thms3 active usersReviewed
Machine LearningStatistics·Captain: iris

Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff: The Bayes-Optimal Classifier's Boundary Risk Vanishes in the Latent Gaussian Mixture ModelResearch Paper

Classifiers that reach high accuracy on test data can often be fooled by perturbations of the input that are small in some norm. Training a classifier to resist such perturbations (adversarial training) typically lowers its accuracy on unperturbed data, and part of the literature argues that this robust–standard accuracy tradeoff is unavoidable: for some…

21 thms3 active usersReviewed
Operations ResearchOptimizationStochastic Systems·Captain: iris

Greedy Algorithm for Multiway Matching with Bounded Regret: The Sum-of-Squares Algorithm Has Any-Time Regret O(1/δ)O(1/\delta)O(1/δ), and O(log⁡t)O(\log t)O(logt) When Configurations Mix Queueable and Nonqueueable ResourcesResearch Paper

Many allocation systems combine units of several resource types into bundles: kidney exchanges, ride-sharing pools, network revenue management (a flight itinerary uses seats on several legs), assemble-to-order production, and online bin packing. Units arrive over time; some can wait in a queue, some must be used on arrival or lost, and some are an inventory…

20 thms3 active usersReviewed
Control TheoryStochastic Systems·Captain: iris

Indefinite Linear-Quadratic Partially Observed Mean-Field Game: With a Relaxed Compensator, the Decentralized Strategies Form an O(1/√N)-Nash EquilibriumResearch Paper

Mean-field games model a large population of agents in which each agent's dynamics and cost depend on the others only through population averages. In the linear-quadratic (LQ) case the agents' states follow linear stochastic differential equations and costs are quadratic, so the equilibrium can be computed from Riccati equations. A standard way to use the…

26 thms3 active usersReviewed
Convex OptimizationOptimization·Captain: iris

Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems: Under Dual Quadratic Growth, the Expected Dual Gap of RCD Contracts at Rate 1 − σ/(m(σ+1))Research Paper

Many problems in signal processing, machine learning and computational geometry ask for a point that minimizes a simple objective over an intersection of convex sets, where projecting onto each single set is easy and projecting onto the intersection is not. The classical instance is the best approximation problem: project a point onto X1∩⋯∩XmX_1\cap\dots\cap X_mX1​∩⋯∩Xm​.…

30 thms3 active usersReviewed
Control TheoryEconomicsOperations Research·Captain: iris

Mean-Variance Portfolio Selection with Dynamic Targets for Expected Terminal Wealth: Closed-Form Equilibrium Strategies for the Three Targets, Each Unique in Its ClassResearch Paper

Mean-variance analysis is the standard model of portfolio choice: an investor fixes a target for expected wealth and minimizes the variance of wealth. In continuous time the problem is time-inconsistent: the strategy that is optimal at time 0 is no longer optimal for the same investor at a later date, because variance is not additive across time. Dynamic…

43 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: iris

State-Dependent Estimation of Delay Distributions in Fork-Join Networks: An Exact Recursion for the Joint Laplace–Stieltjes Transform of the Tagged Customer's Sojourn TimesResearch Paper

Service systems increasingly tell arriving customers how long they will wait. Emergency departments, call centres and repair shops publish delay announcements, and an announcement is only useful if it reflects the state of the system at the moment the customer arrives. For a single queue the state-dependent delay distribution is classical. Many real…

20 thms3 active usersReviewed
Machine LearningStatistics·Captain: iris

Finite-Time High-Probability Bounds for Polyak–Ruppert Averaged Iterates of Linear Stochastic Approximation: Under i.i.d. Noise the p-th Moment Error Is ≲ √(p Tr Σε/n) + ‖ε‖∞(p/n^{3/4} + p²/n)Research Paper

Linear stochastic approximation (LSA) solves a linear system Aˉθ=bˉ\bar{\mathbf A}\theta=\bar{\mathbf b}Aˉθ=bˉ when only noisy observations of the matrix and of the right-hand side are available. It is the linear core of temporal-difference learning with linear function approximation, of stochastic gradient descent on least squares, and of many online estimation…

15 thms3 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

The Competition Complexity of Dynamic Pricing: For ε > 0, m ≥ ϕ(ε)n Buyers Give (1 + ε)Aₘ(F) ≥ Mₙ(F) for Every F, Asymptotically Tight, with ϕ(ε) = Θ(log log 1/ε)Research Paper

A seller with one item faces buyers whose values are drawn i.i.d. from a distribution FFF. The welfare-optimal mechanism is an auction: it allocates to the highest bidder and achieves Mn(F)M_n(F)Mn​(F), the expected maximum of nnn values. Dynamic pricing, which offers the item to the buyers one at a time at prices that may depend on the remaining number of buyers, is…

25 thms3 active usersReviewed
Operations Research·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation XIII: Boole–Bonferroni bounds on the probability of a union from two binomial momentsTextbook

The joint distribution function of a random vector is the quantity that a joint probability constraint P(ξ≤x)≥α\mathbb P(\xi\le x)\ge\alphaP(ξ≤x)≥α asks for. In dimension rrr it is an rrr-dimensional integral, and for most distributions no exact formula is available. The one- and two-dimensional marginals are usually much easier to compute, so stochastic programming algorithms…

29 thms3 active usersReviewed
Operations ResearchOptimization·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation III: separate chance constraints under a multivariate normal distribution are convex for levels at least one halfTextbook

A linear constraint ηTx≥ξ\eta^{\mathsf T}x\ge\xiηTx≥ξ whose coefficients η\etaη and right-hand side ξ\xiξ are random cannot be required to hold for every realization without becoming either infeasible or very conservative. The chance-constrained (probabilistic) approach of Charnes and Cooper asks instead that it hold with a prescribed probability α\alphaα. Whether the…

20 thms3 active usersReviewed
Bandit AlgorithmsMachine Learning·Captain: iris

A General Framework for Bandit Problems Beyond Cumulative Objectives: U-UCB has regret O(log T / T) for every stable, smooth EDPM with a linear gapResearch Paper

In the classical stochastic multi-armed bandit a decision maker is scored by the sum of the rewards it collects. Many applications score the collected rewards differently: a portfolio manager cares about the conditional value at risk (CVaR) or the Sharpe ratio of the returns, a clinical trial about a quantile, a risk-averse controller about mean–variance.…

16 thms3 active usersReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: iris

A Mean-Field Control Problem of Optimal Portfolio Liquidation with Semimartingale Strategies: The Value Function Is Linear-Quadratic in the State's Law and the Optimal Strategy Jumps Only at t and TResearch Paper

A large investor who must sell a position of x0x_0x0​ shares by a deadline TTT moves the price against their own position: every sale depresses the price, and the depression decays only gradually. Optimal liquidation models this trade-off between trading fast (incurring impact) and trading slowly (bearing inventory risk), and it is a standard problem in market…

24 thms3 active usersReviewed
Markov ChainOperations Research·Captain: iris

Improving Blockchain Consistency by Assigning Weights to Random Blocks: Ironclad's Normalized Minimal Adversarial Mining-Power Requirement Strictly Exceeds Nakamoto's (R > 1)Research Paper

Proof-of-work blockchains such as Bitcoin keep a ledger consistent only while the honest parties hold enough mining power relative to an adversary. Network delay erodes that margin: when two honest blocks are mined within the delay bound Δ\DeltaΔ, honest parties extend different chains, and an adversary can exploit the fork. The consistency bound of a…

15 thms3 active usersReviewed
EconomicsOperations Research·Captain: iris

An Equilibrium Model for the Cross-Section of Liquidity Premia: an explicit Radner equilibrium with quadratic transaction costs for any number of agents and assets, via global Riccati solutionsResearch Paper

Assets that are expensive to trade earn higher expected returns than comparable liquid assets. Partial-equilibrium models explain such liquidity premia by taking prices as given and asking how a single investor trades around costs. An explanation of the cross-section of premia needs prices that are themselves set in equilibrium by agents who all pay costs.…

26 thms3 active usersReviewed
Statistics·Captain: iris

Underdogs and One-Hit Wonders: When Is Overcoming Adversity Impressive?: low-quality agents gaining proportionally more from resources is necessary but not sufficient for P(H|F,S) > P(H|S,S)Research Paper

Evaluators in labor markets, venture capital, sports and the arts routinely judge people by their track records. A common intuition holds that two successes are better evidence of talent than one. Another, equally common intuition celebrates the underdog: the agent who succeeds after an initial failure, against the odds. Denrell, Liu and Maslach (Management…

14 thms3 active usersReviewed
Information TheoryQuantum Information·Captain: iris

Distinguishability and Accessible Information in Quantum Theory III: method-of-types bounds on the probability of an empirical frequencyTextbook

A probability assignment can never be confirmed outright, but it can be strengthened or undermined by observation when the phenomenon is repeatable. The Law of Large Numbers says that relative frequencies approach the assigned probabilities. The next question is quantitative: how fast does the probability of an "incorrect" frequency go to zero?

12 thms3 active usersReviewed
Operations ResearchOptimization·Captain: Shuze Chen

Distributionally Robust Inventory Control When Demand Is a Martingale: Closed-form minimax policy, worst-case demand and optimal valueResearch Paper

An inventory manager orders before seeing demand. Unsold stock incurs a holding cost, while unmet demand remains as a backlog and incurs a shortage cost. When the full demand distribution is unknown, a policy can be evaluated by its largest expected cost among distributions consistent with the available information. Dependence across periods matters because…

22 thms3 active usersReviewed
Bandit AlgorithmsOperations Research·Captain: Shuze Chen

Multimodal Dynamic Pricing: High-probability regret for smooth multimodal demandResearch Paper

A retailer learning demand must choose prices before knowing which price earns the most. Each sale provides information only at the price actually posted. A demand curve can have several locally attractive regions, so a method that searches near one apparent optimum can overlook a better region. Wang, Chen and Simchi-Levi study pricing under smoothness…

11 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
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
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
PreviousPage 14 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