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
Operations ResearchStatistics·Captain: mikedeng1

AI Agents for Inventory Control: Human-LLM-OR Complementarity: P[CE > δ] ≥ sup_t (F_a(t) − F_b(t + δ)) for Every Joint Law of (a, b), with Equality for Some CouplingResearch Paper

Large language models are now deployed as decision aids next to human decision-makers, and a basic empirical question is whether the pair does better than either party alone. Baek, Fu, Ma and Peng (arXiv:2602.12631v2) study this question for inventory control: they build a benchmark of multi-period inventory problems, compare operations-research policies,…

15 thms5 active usersReviewed
🏆Completed
Actuarial ScienceOperations ResearchOptimal Transport·Captain: mikedeng1

Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions: Strong Duality for the Worst-Case Spectral Risk Measure over CouplingsResearch Paper

A portfolio loss often depends on several risk factors whose individual distributions can be estimated well but whose joint distribution cannot. Regulators and risk managers then ask for the worst-case risk: the largest value a risk measure can take over all joint laws compatible with the known marginals. For Value-at-Risk and Expected Shortfall of sums…

15 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research·Captain: mikedeng1

An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models: The Adaptive-Confidence Trisection Policy Has N-Independent Regret at Most C√TResearch Paper

A retailer that sells NNN substitutable products must decide, for each arriving customer, which subset of products to display. Customer preferences are unknown at the start and have to be learned from purchases, while every suboptimal display costs revenue. This is dynamic assortment planning, a standard problem of revenue management in e-commerce and online…

17 thms5 active usersReviewed
🏆Completed
Complexity TheoryOperations Research·Captain: mikedeng1

Bayesian Decision Making in Groups is Hard: In the Vertex-Cover Reduction, Small and Large Covers Force Opposite Exponentially Concentrated Beliefs at Time TwoResearch Paper

Models of Bayesian social learning describe agents in a network who each receive a private signal about an unknown state of the world, observe the actions of their neighbours over time, and act optimally given everything they have seen. They are used in economics, operations research and the study of collective decision making to ask whether groups…

13 thms5 active usersReviewed
🏆Completed
Operations ResearchOptimizationStatistics·Captain: Shuze Chen

Modeling, Measuring and Managing Risk I: Characterizations of Stochastic DominanceTextbook

A decision maker who must choose between two uncertain profits Y(1)Y^{(1)}Y(1) and Y(2)Y^{(2)}Y(2) rarely knows their own utility function precisely. Stochastic dominance replaces a single utility by a whole class of them: Y(2)Y^{(2)}Y(2) is preferred if every utility in the class prefers it. The resulting partial orders are the basic consistency requirement for risk and…

11 thms5 active usersReviewed
🏆Completed
Markov ChainOperations Research·Captain: Shuze Chen

Stochastic Networks IX: Time Reversal on Countable State SpacesTextbook

Queueing models describe systems that repeatedly change state: a customer arrives, a service completes, or a circuit becomes free. Their long-run behaviour depends both on how frequently states are visited and on how long each visit lasts. Looking at an equilibrium trajectory backwards produces another process, whose transitions can expose relationships…

6 thms5 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: Shuze Chen

The Nature of Statistical Learning Theory I: The Key Theorem of Learning TheoryTextbook

Empirical risk minimization (ERM) is the inductive principle behind most of statistical learning: a learning machine picks, from a set of functions, the one with the smallest average loss on the training data, in place of the one with the smallest expected loss under the unknown distribution. Whether this substitution is justified is the first question of…

17 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Proximal Gradient Methods with Adaptive Subspace Sampling: Random Subspace Proximal Gradient Descent Converges Linearly in ExpectationResearch Paper

Large-scale composite problems min⁡xf(x)+g(x)\min_x f(x)+g(x)minx​f(x)+g(x), with a smooth loss fff and a nonsmooth regularizer or constraint ggg, are routinely solved by proximal gradient methods. When the dimension is large, computing the full gradient at every step is expensive, and randomized coordinate descent updates only a few coordinates at a time. Classical proximal coordinate…

11 thms5 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Regularized Aggregation of One-Off Probability Predictions: The Jeffreys-Type Priors π(θ; a, b) Give a Proper Posterior When the Probit Predictions Disagree and Their Mean Is Not μ0Research Paper

A decision maker who asks several experts for the probability of a one-off event (an election result, a geopolitical outcome, a product launch) has to turn KKK reported probabilities into one. Simple averages are known to be under-confident when the experts hold different information, and over-confident when they share noise. Model-based aggregators correct…

12 thms5 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

On the Stability of Redundancy Models: With i.i.d. Exponential Copies, the Redundancy-d System under Processor Sharing or Random Order of Service Is Stable Whenever ρ = λ/(µK) < 1Research Paper

Redundancy (sending several copies of a job to different servers and keeping the first one to finish) is a standard way to cut response times in parallel computing systems whose servers have variable speeds: replicated requests in data centres, speculative execution in MapReduce-type frameworks, duplicated queries in distributed storage (Vulimiri et al.,…

14 thms5 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

Is Price Commitment a Better Solution to Control Carbon Emissions and Promote Technology Investment?: Correlation Thresholds for Consumer Surplus and Emissions, Carbon Tax vs Cap-and-TradeResearch Paper

Carbon pricing changes both a manufacturer's production decisions and its incentive to invest in cleaner technology. A carbon tax fixes the price of emissions in advance. Cap-and-trade fixes an emissions quota while the price of permits changes with market conditions. The comparison is especially sensitive to whether high product demand tends to coincide…

10 thms5 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low II: Four Gaussian Noise Events Behind the Error Bounds Hold with High ProbabilityResearch Paper

Best subset selection fits a linear model using at most kkk of ppp candidate predictors. When the noise level is high relative to the signal, it overfits. Mazumder, Radchenko and Dedieu (arXiv:1708.03288v4; Operations Research, 2023) add a shrinkage penalty λ∥β∥q\lambda\|\beta\|_qλ∥β∥q​, q∈{1,2}q\in\{1,2\}q∈{1,2}, to the best-subsets problem and prove oracle inequalities for the…

11 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryFunctional AnalysisMechanism Design+1·Captain: mikedeng1

Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees 1: A Value Pacing-Based Symmetric First Price Equilibrium ExistsResearch Paper

Most online advertising is sold by auction, one impression at a time, to advertisers who manage a budget over many auctions rather than a value for a single one. Since 2019 the major ad exchanges have moved from second price to first price auctions, in which the winner pays its own bid. A budget-constrained advertiser in a first price auction must therefore…

20 thms5 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Lightning Network Economics: Channels II: A Payment Channel Beats On-Chain Settlement Only If the On-Chain Fee Exceeds an Explicit ThresholdResearch Paper

Every Bitcoin transaction recorded on the blockchain pays a fee, and the blockchain processes only a few transactions per second. The Lightning Network is a layer-two protocol that moves repeated payments off chain: two parties lock funds in a payment channel, exchange payments by updating the channel's balance, and touch the blockchain only to open, close…

35 thms5 active users
🏆Completed
CombinatoricsOperations ResearchOptimization+1·Captain: mikedeng1

Pricing in On-Demand and One-Way Vehicle-Sharing Networks 3: The K/(N+K−1+Λ/μ) Guarantee Holds When Static Prices Split the Network into ComponentsResearch Paper

One-way vehicle-sharing systems (car sharing, bike sharing, on-demand fleets) move a fixed fleet of KKK vehicles among NNN locations. Customers take a vehicle at one location and leave it at another, so prices shape both revenue and where the fleet ends up. The optimal dynamic pricing policy, which reacts to the current position of every vehicle, solves a…

26 thms5 active users
🏆Completed
Markov ChainOperations Research·Captain: mikedeng1

Lightning Network Economics: Channels IV: The Long-Run Number of Channel Transactions per On-Chain Transaction in Closed FormResearch Paper

A blockchain such as Bitcoin settles a limited number of transactions per unit of time, and every on-chain transaction pays a fee that rises with congestion. The Lightning Network moves payments off the chain. Two parties lock funds in a payment channel with one on-chain transaction, and they can then pay each other any number of times by updating the…

13 thms5 active usersReviewed
🏆Completed
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

Quantum Amplitude Amplification and Estimation: Est_Amp(A, χ, M) Outputs ã with |ã − a| ≤ 2πk√(a(1−a))/M + k²π²/M² with Probability ≥ 8/π² for k = 1 and > 1 − 1/(2(k−1)) for k ≥ 2Research Paper

Many quantum algorithms end in a measurement that succeeds only with some probability aaa. Two questions follow: how to raise that probability, and how to learn its value. G. Brassard, P. Høyer, M. Mosca and A. Tapp answered both in Quantum Amplitude Amplification and Estimation (arXiv:quant-ph/0005055, 2000; Contemporary Mathematics 305, 2002). Amplitude…

14 thms5 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchOptimization+1·Captain: mikedeng1

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes II: With Infinite Patience, Attenuated Random-Order Probing Probes Each Edge w.p. ≥ (1 − e^(−2))y_e/2Research Paper

In stochastic matching a platform knows, for every potential pair, the probability that the pair would succeed, but learns whether it does only by trying it, and a successful trial is binding. Kidney exchange, online dating and labour markets are the standard examples: a crossmatch test, a date or an interview is a probe whose outcome is random, and a…

10 thms5 active users
🏆Completed
Algorithmic Game TheoryCombinatoricsEconomics+1·Captain: mikedeng1

Endogenous Risk Exposure and Systemic Instability II: Banks Take More Risk in the Least Equilibrium of a Complete Network than of a Ring NetworkResearch Paper

Banks lend to one another, and the shape of the resulting network decides how a loss at one bank reaches the others. A long line of work, starting with Allen and Gale (2000) and continued by Acemoglu, Ozdaglar and Tahbaz-Salehi (2015), compares the ring network, where each bank is owed money by one neighbour, with the complete network, where every bank…

15 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Reducing Marketplace Interference Bias Via Shadow Prices 3: The Scaled Expected Matching Value Converges to the Fluid LP Value Φ(λ, π)Research Paper

Two-sided platforms (ride hailing, delivery, freelancing, logistics) collect demand and supply requests over a matching cycle and then clear them with an optimization problem. When such a platform runs an experiment, treated and control units compete for the same supply, so the outcome of one unit depends on the treatment of others. Interference bias of…

7 thms5 active users
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Optimality Conditions in Control Problems with Random State Constraints in Probabilistic or Almost Sure Form I: Necessary and Sufficient Optimality Conditions for a Gaussian Probabilistic ConstraintResearch Paper

Probabilistic (chance) constraints require that a decision keeps a random constraint satisfied with probability at least ppp. They are the standard way to model reliability requirements in engineering design, energy networks and the control of systems driven by uncertain data, and they are increasingly imposed on infinite-dimensional decisions such as the…

19 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Imperfect Targeting and Advertising Strategies: With Costless Advertising and A < 1/4, Equilibrium Industry Profit Falls as Targeting Improves, Jumps Up at α̂₂(A), Then Stays ConstantResearch Paper

Online advertising lets a firm aim its messages at the consumers most likely to want its product, but the data behind that aim is noisy: a platform's prediction of who belongs to a demographic or interest segment is right only with some probability. A natural expectation is that sharper targeting raises firms' profits, since fewer messages are wasted. Karle…

10 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Optimality of Affine Policies for Budgeted Uncertainty Sets 1: For Budget of Uncertainty Sets, Affine Policies Approximate the Two-Stage Adjustable Robust Problem within O(log n / log log n)Research Paper

Two-stage adjustable robust optimization models decisions taken in two steps around an uncertain demand: a first-stage decision is fixed now, the demand is revealed, and a second-stage (recourse) decision reacts to it. The objective is the worst-case total cost over a set of possible demands. The model covers set cover, capacity planning and network design…

20 thms5 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios III: No Online Algorithm Earns More Than F(𝒫) Times the Expected Offline OptimumResearch Paper

A firm sells several products, each in limited supply. Customers arrive one at a time, and each product can be offered at one of a few prices. This is the setting of airline fare classes, hotel rate plans and e-commerce discounting. Because future demand is unknown, the firm must decide online whether to sell a unit now at a low price or keep it for a…

13 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios I: Multi-price Balance Is minᵢ F̃ᵢ-Competitive, F̃ᵢ Bounded via F(𝒫ᵢ), G(𝒫ᵢ)/2 and kᵢResearch Paper

Online matching and its revenue-management variants model a firm that allocates limited inventory to customers who arrive one at a time, without knowing who comes next. Classical results in this area assume each item has a single price, or weight. For a single price and large inventories, the BALANCE algorithm of Kalyanasundaram and Pruhs (2000) and its…

11 thms5 active usersReviewed
PreviousPage 3 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