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
EconomicsOperations Research·Captain: mikedeng1

Naive Learning Through Probability Overmatching: Along Any Vanishing-Influence Network Sequence, Extremization DeGroot Processes Eventually Agree on the True State with Probability Tending to OneResearch Paper

Models of naive social learning ask whether agents who update by simple averaging rules, rather than by Bayes' rule, can still aggregate dispersed information. In the classic DeGroot model every agent repeatedly replaces her belief by a weighted average of her neighbours' beliefs. Golub and Jackson (2010) showed that when agents communicate real-valued…

12 thms3 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization·Captain: Shuze Chen

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models: The Sampled Upper Base-Stock Policy Costs at Most (1 + ε) Times the Optimum with Probability 1 − δResearch Paper

The periodic-review inventory problem asks how much stock to order in each of TTT periods when demand is random, unmet demand is backlogged, and both leftover stock and shortages are charged. When the demand distributions are known, a backward dynamic program computes an optimal policy, and the optimal policy is a base-stock policy: in each period, order up…

15 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling XII: Level-Dependent QBDs and Their Minimal SolutionsTextbook

Many queueing and reliability models are Markov chains on a two-dimensional state space whose first coordinate, the level, moves by at most one unit per transition, while the second, the phase, records an auxiliary state such as the phase of a service time or the number of busy servers. When the transition probabilities do not depend on the level, such a…

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

Competition and Opacity in the Financial System: Intense Competition Lowers Disclosure Precision Exactly When Investors' Private Information Is PreciseResearch Paper

Banks and other financial institutions are notoriously hard to see into: their loan books are complex and their public reports are coarse. A long-standing policy question is whether competition among financial institutions makes them more or less transparent. One view holds that competition for funding disciplines institutions into disclosing more; another…

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

Beta and Coskewness Pricing: Perspective from Probability Weighting: The Rank-Dependent Equilibrium Pricing Kernel and the Three-Moment CAPMResearch Paper

Asset-pricing models relate an asset's expected return to the risks it shares with the market. A familiar covariance term measures exposure to the market return, while a coskewness term measures exposure to the square of that return. Shi, Cui and Zhou ask how these two coefficients change when investors weight probabilities as well as valuing outcomes.…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Optimal Auction Duration: A Price Formation Viewpoint: Semi-Explicit Formula for the Expected Squared Clearing-Price Error E(h) as a Function of the Auction DurationResearch Paper

Most equity markets trade through a continuous limit order book (CLOB): any market order is matched immediately against the resting limit orders. Budish, Cramton and Shim (QJE 2015) argued that continuous matching creates mechanical arbitrage and a race in speed between high-frequency market makers, and proposed frequent batch auctions instead, with a lower…

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

“Zero Cost” Majority Attacks on Permissionless Blockchains: Under Congestion, a Miner With Less Than Half the Hash Power Gains From a Majority Attack Even With Nothing to Double-SpendResearch Paper

A majority attack lets a miner create blocks on a private branch of a permissionless blockchain and later publish that branch as the accepted transaction history. The familiar motive is a private benefit from changing the record, such as a double-spend. Gans and Halaburda show that this motive need not be present: when transactions compete for limited block…

7 thms3 active usersReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients: The Strategy Built from Iterated Snell Envelopes Is Optimal over All Admissible Delayed Impulse StrategiesResearch Paper

Impulse control models a decision maker who acts on a system by discrete interventions rather than continuously: a central bank adjusting a rate, a firm switching production capacity, a portfolio manager rebalancing with fixed transaction costs. Each intervention has a fixed cost, so the controller chooses both when to act and how much. In many applications…

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

Order Protection through Delayed Messaging: Unique Market Equilibrium with Closed-Form Shares of Pegged Orders, Market Makers and Snipers when Midpoint Pegs Are ProtectedResearch Paper

Continuous limit-order markets reward speed. When the fundamental value of an asset moves, a trader with a faster connection can trade against stale quotes before the quoting liquidity provider can cancel them. This practice, sniping, is a direct transfer from liquidity providers to fast traders, and it has been documented and analysed as a cost of the…

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

Delegation of Stocking Decisions Under Asymmetric Demand Information: With Two Demand States, Early Stock-Out Inspection Makes the Store Manager Order the Principal's Optimal QuantityResearch Paper

Retail chains routinely delegate replenishment decisions to store managers. The manager sees signals the head office does not: local events, weather, the mood of the neighbourhood. The head office (the principal) knows only the probabilities of these demand states. It also cannot observe lost sales directly, because unmet demand leaves no record, so it…

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

Ranking Distributions When Only Means and Variances Are Known: Y Dominates X by First-Order Almost Stochastic Dominance for γ ≥ 1/(1 + 2t(t + √(t² + 1))), t = (μ_Y − μ_X)/(σ_Y + σ_X)Research Paper

Decision analysts routinely have to rank two risky prospects, with returns XXX and YYY, when nothing is known about them beyond a mean and a standard deviation for each. The classical tools are of two kinds. First-order stochastic dominance (FSD) ranks YYY above XXX for every increasing utility, but it can never be certified from means and variances alone: with…

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

Consumer Equilibrium, Demand Effects, and Efficiency in Group Buying: Existence and Uniqueness of the Dynamic Threshold Sign-Up Equilibrium of a Two-Threshold Group Buying EventResearch Paper

In a group-buying event a retailer offers a product at a discount that materializes only if enough customers sign up before a deadline. Platforms such as Taobao and JD run such events with several deal levels: the more customers join, the lower the final price. Each arriving customer must decide whether to join without knowing how many others will follow,…

7 thms3 active usersReviewed
Control TheoryEconomicsOperations Research·Captain: mikedeng1

Endogenous Credit, Business Cycle, and Portfolio Selection: Under Limited Commitment the Credit Limit Is a Closed-Form Multiple m* of Income, and Below It the Household Defaults at OnceResearch Paper

A household can borrow against expected future income only while repayment remains preferable to default. In the baseline model of Choi, Koo, Lim and Yoo, this choice is imposed through a participation condition at every date: the household's remaining utility from its planned consumption must be at least its remaining utility after default. The constraint…

14 thms3 active usersReviewed
🏆Completed
AnalysisNumerical AnalysisOperations Research·Captain: mikedeng1

Fast Hybrid Schemes for Fractional Riccati Equations (Rough Is Not So Tough): Explicit Lower and Upper Bounds on the Convergence Radius of the Fractional Power-Series SolutionResearch Paper

In the rough Heston model of El Euch and Rosenbaum, the variance of an asset is driven by a fractional kernel with Hurst exponent H<12H<\tfrac12H<21​, which matches the roughness observed in realized volatility. The model keeps one feature of the classical Heston model: the characteristic function of the log-price is explicit up to the solution of a deterministic…

13 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Does Competition Improve Analysts’ Forecast Informativeness?: Competition Lowers Informativeness Exactly When Payoffs Are Convex in Rank, Signals Are Correlated and Prior Uncertainty Is HighResearch Paper

Sell-side analysts are ranked against each other. Published rankings, such as Institutional Investor's annual "All-Star" ranking cited in the paper, and the career outcomes tied to them, reward an analyst for being more accurate than peers, not only for being accurate. A common intuition holds that such competition disciplines analysts and makes their…

32 thms3 active users
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization: Almost Surely, SMM Accumulation Points Minimize a Limiting Convex SurrogateResearch Paper

Many risk-averse decision problems are not expectations of a loss but nonlinear functions of several nested expectations. The optimized certainty equivalent of a deviation, the buffered probability of exceedance and mean–deviation criteria all take the form "a convex isotone function of an expectation of a convex function of a random map and of another…

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

A Model of Cryptocurrencies: With Observable Fundamentals the Market Has Two, One or No Cutoff Equilibria as A + ξ Is Above, At or Below a Threshold, and the Two Equilibria Respond OppositelyResearch Paper

A cryptocurrency launched through an initial coin offering is often sold before the platform it serves has users. Its value to a buyer then depends on who else buys: a token that gives access to a trading network is worth more when many households with large endowments join. Sockin and Xiong (preliminary draft, March 2018, later published in Management…

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

Learning in a Post-Truth World: Below a Misinformation Threshold Bayesian Societies Mislearn No More Often than DeGroot Societies, and Above It Strictly More OftenResearch Paper

People receive both informative reports and messages that are unrelated to the truth. A standard question in social learning is whether sharing beliefs helps a population identify the correct state. The question changes when everyone knows misinformation exists but does not know its ideological direction. Mostagir and Siderius study this setting and show…

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

Engineering Social Learning: Information Design of Time-Locked Sales Campaigns for Online Platforms: Optimal Revenue over All Information Policies Equals a Recommendation-Policy Linear ProgramResearch Paper

An online platform can know more about a product than a customer arriving for a short sales campaign. It sees earlier customers' purchase decisions and the messages it sent them, while a new customer sees only her own message and private assessment. Choosing what to disclose can raise immediate sales, but a customer's response can also reveal information…

8 thms3 active usersReviewed
Actuarial ScienceOperations Research·Captain: mikedeng1

On the Profitability of Selfish Blockchain Mining Under Consideration of Ruin: Closed-Form Expected Surplus of a Selfish Miner under Ruin up to an Exponential Time HorizonResearch Paper

A blockchain miner pays for electricity and equipment while block rewards arrive at irregular times. A strategy that raises the average reward can still expose a miner with limited capital to ruin before those rewards arrive. Albrecher and Goffard study this tension for a simplified selfish mining strategy in which the miner temporarily withholds a…

8 thms3 active usersReviewed
Dynamical SystemsGroup Theory·Captain: dbenbenn

Is the group IET of interval exchange transformations amenable?Open Problem

This mission formalizes the question whether the group IET\mathrm{IET}IET of interval exchange transformations is amenable, Question 1.6 of Juschenko, Matte Bon, Monod and de la Salle, Extensive amenability and an application to interval exchanges, Ergodic Theory Dynam. Systems 38 (2018) 195–219, p. 4 (doi:10.1017/etds.2016.32), together with the landmark results…

33 thms3 active usersReviewed
🏆Completed
Markov ChainOperations Research·Captain: mikedeng1

A Token-Based Central Queue with Order-Independent Service Rates: Under the Assignment and Order-Independent Conditions the Stationary Distribution Has a Product FormResearch Paper

Many service systems match heterogeneous customers to heterogeneous resources: jobs to machines in a data centre, patients to beds, orders to couriers, donors to recipients. A recurring question is whether such a system, run first-come-first-served among compatible pairs, has a stationary distribution that can be written down. Two lines of work answered it…

14 thms3 active usersReviewed
Calculus of VariationsOperations ResearchStochastic Systems·Captain: mikedeng1

Large Deviations for the Single-Server Queue and the Reneging Paradox: The Long-Time Decay Rate of Atypical Reneging Is an Explicit C(γ) Independent of the Reneging RateResearch Paper

Customer abandonment, or reneging, is a basic feature of service systems: call centres, emergency departments and online platforms all lose customers who give up waiting. The number of reneging customers is a natural performance measure, and in many-server and single-server models alike it is the quantity managers monitor and are penalised for. Typical…

18 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Inventory Integration with Rational Consumers: Unique Correlation and Variability Thresholds Below Which the Behavioral Value of Integration Is PositiveResearch Paper

Inventory integration (or pooling) serves several markets from one stock instead of one stock per market. Its classical value is statistical: when demands are not perfectly correlated, the pooled demand is relatively less variable, so less safety stock is needed for the same service level. Eppen (Management Science, 1979) quantified this for normal demand,…

13 thms3 active usersReviewed
Bandit AlgorithmsMachine Learning·Captain: mikedeng1

Online Learning over a Finite Action Set with Limited Switching: An Algorithm for Prediction From Experts Whose Regret and Number of Switches Are Both O(√(T log n log(1/δ))) with Probability 1 − δResearch Paper

In prediction from experts (PFE), an online learner chooses one of nnn actions in each of TTT rounds, and an adversary assigns each action a loss in [0,1][0,1][0,1]. Performance is measured by regret, the learner's total loss minus that of the best single action in hindsight. In many applications changing the action is itself costly: re-routing traffic, re-balancing a…

10 thms3 active usersReviewed
PreviousPage 34 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