Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,744 missions · 1,550 completed

Missions

Open1194Completed1550All2744
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Extremizing and Antiextremizing in Bayesian Ensembles of Binary-Event Forecasts: Jointly Normal Information States Make the Generalized Probit Ensemble the Optimal AggregatorResearch Paper

A decision maker often receives several probability forecasts for the same binary event. The forecasters may have overlapping information, so averaging their numbers can count shared evidence more than once. Lichtendahl, Grushka-Cockayne, Jose and Winkler study the probability of the event conditional on the forecasts themselves. Their generalized probit…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Robust Bidding in First-Price Auctions: How to Bid Without Knowing What Others Are Doing: Under Variation in Bidding the Unique Minimax Loss Bid Equalizes Both Maximal Losses and Increases in nResearch Paper

First-price sealed-bid auctions are used for procurement contracts, treasury securities, timber, and, since 2019, most display advertising. The classical advice for how to bid comes from Bayes–Nash equilibrium: each bidder knows the distribution of the others' values, and everyone plays the equilibrium. Practitioners rarely have that information. In a…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchStochastic Systems·Captain: mikedeng1

Queueing with Negative Network Effects: Closed-Form Joint Law of the Later Arrivals Met and the Queue-Filling Arrivals for a Customer Joining an M/M/c/n Queue at Position jResearch Paper

In many service systems a waiting customer is harmed not only by the time spent in line but also by the other customers met there. Contagion in a clinic, a pharmacy or a government office during an epidemic is the motivating example of Hassin, Meilijson and Perlman, Queueing with Negative Network Effects (SSRN 4097977, 2022; Manufacturing & Service…

7 thms2 active usersReviewed
🏆Completed
Markov ChainOperations Research·Captain: mikedeng1

Diffusion of New Products with Heterogeneous Consumers: In a Complete Network, Heterogeneity in the External Influence Rates Always Slows Down the Expected AdoptionResearch Paper

The Bass model describes how a new product spreads when consumers can adopt through external exposure and through contact with previous adopters. A homogeneous model assigns the same response rates to everyone. Actual networks can have consumers who respond at different rates, even when the average rate is known. For a fixed average, it is therefore useful…

6 thms2 active usersReviewed
🏆Completed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Optimal Retirement Under Partial Information: If a Dual Multiplier and a Dual-Optimal Retirement Time Meet the Budget, Their Plan Is Optimal and There Is No Duality GapResearch Paper

When to stop working is one of the largest financial decisions a household makes, and it interacts with how much to consume and how to invest. In the continuous-time literature the decision is modelled as an optimal stopping time chosen jointly with consumption and portfolio controls; the standard tool is convex duality, which turns the coupled…

16 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

A Casino Gambling Model Under Cumulative Prospect Theory: Analysis and Algorithm: A Centred Law on [−T, T] Is the Law of S_τ for Some Stopping Time τ ≤ T iff Its Potential Satisfies (8)Research Paper

Barberis' casino gambling model (Barberis 2012) asks when a gambler with cumulative prospect theory (CPT) preferences should leave a casino. At each of the times t=0,1,…,T−1t=0,1,\dots,T-1t=0,1,…,T−1 the gambler either stops or bets $1 on a fair coin. The value of a stopping strategy τ\tauτ depends on it only through the law of the gain at exit, SτS_\tauSτ​. Probability weighting makes…

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

Systemic Risk-Driven Portfolio Selection: Closed-Form Portfolio Maximizing Co-Expected Returns When the System Is at Its VaR Level and Portfolio Returns Are below CoVaRResearch Paper

A portfolio can look attractive on average and still perform poorly when the financial system is under stress. Capponi and Rubtsov's Systemic Risk Driven Portfolio Selection asks an investor to choose asset weights using the portfolio return expected in a specified system stress state, rather than using only an unconditional mean or variance. The question…

10 thms2 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research·Captain: mikedeng1

Principal Trading Arrangements: When Are Common Contracts Optimal?: The Guaranteed VWAP Contract Is an Optimal Contract for the Client in the Specialized ModelResearch Paper

A client who needs to buy a security may hire a dealer to execute the purchase. The client can observe market prices and trading volume but cannot observe the dealer's trades or the market conditions known to the dealer before trading. A contract based on the closing price or another benchmark can therefore change the dealer's incentives. Baldauf, Frei, and…

13 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Profit or Growth? Dynamic Order Allocation in a Hybrid Workforce: The Variance of the Cross-Network Effect Decides Whether Market Thickness Benefits or Costs the SystemResearch Paper

Many firms that run their own delivery or service workforce have started to operate a hybrid workforce: salaried employees serve part of the demand, while a crowd of independent freelancers on a platform owned by the same firm serves the rest. A firm in this position faces a recurring allocation question. Every order sent to the platform pays freelancers…

10 thms2 active usersReviewed
Control TheoryPartial Differential Equations·Captain: mikedeng1

Nonconcave Utility Maximization with Portfolio Bounds: The Value Function Is the Unique Viscosity Solution of the HJB Equation under the New Terminal Asymptotic ConditionResearch Paper

An investor may care about reaching a target, avoiding a loss, or crossing an aspiration level rather than maximizing a concave function of final wealth. A target reward can jump from zero to one at a specified wealth. Such nonconcave utility is a natural model for goal-reaching portfolios, but its discontinuity changes what the associated…

9 thms2 active usersReviewed
Algorithmic Game TheoryControl TheoryOperations Research+1·Captain: mikedeng1

Dynkin Games with Incomplete and Asymmetric Information: With Linear Payoffs, a Threshold Stop and a Belief-Reflecting Randomised Stop Form a Saddle PointResearch Paper

An optimal stopping game asks two players to choose when to stop a shared process. The first player receives one payoff if they stop first and another if the second player stops first. Such a game changes when one player knows a parameter that the other can only infer from observations. The informed player can reveal information through the timing of a…

19 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs: An Upper Bound on the Long-Run Average Cost of Modified Echelon (r,Q) PoliciesResearch Paper

A one-warehouse, multi-retailer (OWMR) distribution system is the basic model of a supply chain in which a central warehouse buys from an outside supplier and ships to several retail locations. When every shipment carries a fixed cost and a positive lead time, the optimal policy of the stochastic system is unknown, and the classical approach is to search…

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

Optimal Sequential Multi-class Diagnosis: Under Exponential Tilting, Every Reachable Posterior Belief Is a Closed-Form Function of an r-Dimensional Diagnostic Statistic, r = rank(B)Research Paper

In sequential multi-class diagnosis, a decision maker observes a system repeatedly, then chooses when to stop and which hidden class to report. Each new observation can improve the diagnosis, but waiting has a cost. A direct dynamic program uses the vector of posterior class probabilities as its state. With N+1N+1N+1 possible classes, that state lies in an NNN-dimen…

8 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling: Fluid-Scaled States Are Tight and Their Limit Points Are Fluid Model SolutionsResearch Paper

Call centers, hospital wards and other service systems with many agents serve several customer classes, and customers who wait too long hang up or leave. The standard model is the multiclass many-server queue with reneging: NNN identical servers, JJJ classes, class-dependent service-time and patience-time distributions, and a control policy that decides when an…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Exploiting Random Lead Times for Significant Inventory Cost Savings: With Exponential Lead Times, the Generalized Base-Stock Policy's Scaled Stationary Inventory Level Converges to N(0, 1/(βγ))Research Paper

In continuous-review inventory systems with backlogging, the classical constant base-stock (CBS) policy orders one unit whenever one unit of demand arrives, so that the inventory position (net inventory plus in-transit inventory) stays constant. Under CBS with Poisson demand of rate rrr and i.i.d. lead times with mean 1/β1/\beta1/β, the in-transit inventory has a…

17 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times: Fluid Limit of the Maximum Queue Length with a Non-Zero Initial ConditionResearch Paper

A fork-join queue splits every incoming job into tasks, sends one task to each of NNN parallel servers, and declares the job complete only when all tasks are done. The model describes assembly systems in which a manufacturer orders parts from NNN suppliers and can only start production when every part has arrived, as well as parallel computing and storage…

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

Costly Interpretation of Asset Prices: With Costly Price Interpretation There Is a Unique Linear Financial Market Equilibrium, and Its Price Carries Endogenous NoiseResearch Paper

A central question of financial economics is how much of the information dispersed among traders ends up in market prices. The workhorse model is the noisy rational expectations equilibrium (REE): investors with private signals trade a risky asset, the price aggregates their information, and each investor learns from the price as well as from her own signal…

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

Stochastic Knapsack Revisited: The Service Level Perspective: Anticipative Policies Need at Most 2Δ More Capacity Than Adaptive Policies to Meet Type-I Service LevelsResearch Paper

A central planner holds a single pool of QQQ units of a product and must supply NNN customers whose demands d~1,…,d~N\tilde d_1, \dots, \tilde d_Nd~1​,…,d~N​ are random. Each customer iii asks to be fully served, i.e. to receive her entire demand, with probability at least a target αi\alpha_iαi​. This Type-I service level (the persistency value of the stochastic knapsack) is the standard…

9 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

Discrete Dividend Payments in Continuous Time: The Value Function Is the Unique Fixed Point of the One-Period Dividend-and-Issuance OperatorResearch Paper

A firm can return cash to shareholders by paying dividends, but a payment reduces the reserves available to survive future losses. If cash can be distributed only at scheduled dates while equity can be raised between those dates, the firm must coordinate a discrete dividend decision with a continuous-time financing decision. Keppo, Reppen and Soner study…

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

Pricing of Debt and Equity in a Financial Network with Comonotonic Endowments: Closed-Form Default Probabilities and Expected Wealth, Debt Payments and Equity under Bankruptcy CostsResearch Paper

Banks hold claims on one another. When one bank cannot pay, its creditors receive less, which can push them into default in turn. Clearing models compute the payments and wealths that are consistent across the whole network. Regulators and researchers use them to measure systemic risk and to price interbank debt. The basic model is that of Eisenberg and Noe…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

A General Framework to Compare Announcement Accuracy: Static vs. LES-Based Announcement: The Static Announcement Has No Larger MSE if and only if the Correlation Is at Most 1/2Research Paper

A customer who is told that service will be delayed can use the announced wait to decide whether to stay, leave, or plan around the delay. A service operator needs to know whether a changing, customer-specific announcement actually predicts the eventual wait more accurately than a fixed announcement. Bassamboo and Ibrahim studied this question for the last-e…

5 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Adversarial Patrolling in a Uniform: Attacking in the Second Period of the Patroller's Absence and Never Staying at a Location Are Optimal Strategies for Every Attack DurationResearch Paper

A visible patroller gives an attacker information: the attacker can observe when a location is vacant and wait for a favorable moment. This changes the patrolling problem from choosing how often to visit each location to choosing a movement rule that remains effective against an adversary who chooses the attack time. The preprint The Uniformed Patroller Game…

12 thms2 active usersReviewed
Graph TheoryOperations Research·Captain: mikedeng1

A Dynamic Contagion Risk Model with Recovery Features: Fluid Limit for the Final Fraction of Failed Nodes in Threshold Contagion with Growth on the Configuration ModelResearch Paper

Financial networks, supply chains and contact networks share a failure mode: a node fails when enough of its counterparties have failed, and its failure in turn weakens its own counterparties. Threshold contagion on random graphs is the standard mathematical model of this. Amini, Cont and Minca (Resilience to contagion in financial networks, Mathematical…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Optimal Patrol of a Perimeter: Optimal Randomized Patrol Schedule and Value of the Patrol Game Against an Observing AttackerResearch Paper

Patrolling protects a border or facility perimeter against an intruder who needs uninterrupted time to complete an attack. The defender controls when patrollers pass; the attacker controls when to strike. In a patrol game, the question is how to time patrols when the attacker can observe them (Lin, Optimal Patrol of a Perimeter).

9 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Prepositioning and Local Purchasing for Emergency Operations Under Budget, Demand, and Supply Uncertainty: Above a Budget Threshold, Optimal Prepo Stock Is the Newsvendor Fractile of Net DemandResearch Paper

Humanitarian organizations (HOs) such as the Red Cross or UNICEF keep prepositioned stock ("prepo") of relief items in distribution centres, so that they can fly supplies to a disaster area in the first days after a rapid-onset event. A second source is local purchasing in or near the affected region after the disaster strikes: it is cheaper per unit and…

8 thms2 active usersReviewed
PreviousPage 71 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