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

The Value of Price Discrimination in Large Random Networks: The Expected Fractional Regret of Uniform Pricing Vanishes in Erdős–Rényi Networks of Any DensityResearch Paper

A seller whose customers influence one another faces a choice between two pricing policies. It can collect information about the social network and charge each customer a personalised price that reflects their position in it, or it can ignore the network and charge everyone one uniform price. Personalised pricing is never worse for the seller, but…

15 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatoricsOperations Research·Captain: mikedeng1

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution: Without Samples, No Stopping Rule Guarantees More Than 1/e of the Expected MaximumResearch Paper

A prophet inequality compares the value obtained by an online decision maker with the largest value in a sequence that could be chosen by someone who sees the entire sequence. The online decision maker observes values one at a time and must decide whether to accept the current value before seeing future values. When the common distribution of the values is…

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

Correlated Equilibria and Mean Field Games: A Simple Model: Every Limit Point of Symmetric ε_N-Correlated Equilibria in Restricted Strategies Is a Correlated Mean Field Game SolutionResearch Paper

A correlated equilibrium (Aumann, 1974) is a profile of strategies chosen by a mediator: the mediator draws a joint recommendation from a known distribution, tells each player only their own component, and no player can lower their expected cost by systematically deviating from what they are told. Correlated equilibria contain the Nash equilibria, are…

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

The Discrete Moment Problem with Nonconvex Shape Constraints: Optimal Extreme Point Solutions of the Log-Concave Discrete Moment Problem Are Piecewise Geometric with at Most m PiecesResearch Paper

A discrete moment problem asks for the largest expected payoff compatible with prescribed moments of an unknown probability distribution. A decision maker may know the first few moments of demand or loss while the full distribution remains uncertain. The optimization then asks which compatible distribution makes a chosen payoff largest. Chen, He, Jiang,…

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

The Role of Participation in Innovation Contests: Multiple Rewards Are Optimal Exactly When Entry Is Costly, the Budget Is Large and a Failed Contest Is CostlyResearch Paper

An innovation contest asks people outside a firm to submit solutions and promises payments according to the rank of their submissions. The firm would like a strong best submission, but a potential solver must decide whether entering is worth a fixed cost before knowing who else will enter. Paying only the winner can encourage effort while leaving the…

12 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Strong Algorithms for the Ordinal Matroid Secretary Problem: Every Algorithm with Forbidden Sets of Size k Is α(k) Probability-CompetitiveResearch Paper

The secretary problem asks an online decision maker to pick the best of nnn candidates who arrive in uniformly random order, deciding irrevocably on each one at arrival. Its matroid generalization, the matroid secretary problem (MSP) of Babaioff, Immorlica and Kleinberg (SODA 2007), asks the algorithm to select an independent set of a matroid whose elements…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsMechanism Design·Captain: mikedeng1

A Rationale for Imperfect Reporting Standards: With a Low Payoff Threshold and a High Prior, a Conservative Report Beats a Perfectly Informative OneResearch Paper

Financial reports help investors value a firm, but a firm can also learn and voluntarily disclose information outside the report. A regulator who makes mandatory reports more precise changes the firm's incentive to acquire that other information. Friedman, Hughes and Michaeli's 2020 preprint, Proposition 1, studies whether a reporting rule that is less…

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

Information Inundation on Platforms and Implications: Under Unknown Post Accuracy, Screening for the Largest Expected Variance Reduction Selects the Post Closest to the BeliefResearch Paper

Online platforms show a reader many short signals about the same question (posts, headlines, tweets), more than the reader can absorb. The reader screens the menu and consumes only a few items. Allon, Drakopoulos and Manshadi (Information Inundation on Platforms and Implications, SSRN 3385627; Operations Research, 2021, doi:10.1287/opre.2021.2119) ask what…

11 thms3 active users
Operations ResearchStochastic Systems·Captain: mikedeng1

Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies: Under Phase-Type File Sizes the Weighted Mean Flow Count Lies Between Ls·min κ/ε and Ls·max κ/εResearch Paper

In a communication network, file transfers ("flows") share the capacity of the links on their routes, and the bandwidth-sharing policy decides how much rate each flow receives. The connection-level model of Massoulié and Roberts (2000) treats flows as customers that arrive at random, carry a random amount of data, and leave once it is transferred. Under weig…

18 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

On the Fair Division of a Random Object: The Bottom-Heavy Rule Dominates Every Other Symmetric Almost Prior-Independent Rule for Bads Satisfying Fair ShareResearch Paper

Many allocation problems divide an object whose value to the participants is uncertain at the time the division rule is designed: computing time on a shared cluster, a recurring chore, the cost of a service used jointly. If the rule must be fixed before the realizations are known, and must treat everyone fairly in expectation, the designer faces a tradeoff…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator: Without Sparsity Information the Robust Estimator Is a Closed-Form Shrinkage of the Sample EigenvaluesResearch Paper

The precision matrix X=Σ−1X=\Sigma^{-1}X=Σ−1 of a Gaussian random vector ξ∈Rp\xi\in\mathbb R^pξ∈Rp encodes its conditional independence structure: Xij=0X_{ij}=0Xij​=0 exactly when ξi\xi_iξi​ and ξj\xi_jξj​ are independent given the other coordinates. Estimating it is a basic step in Gaussian graphical models, portfolio selection and linear discriminant analysis. The textbook estimator, the…

14 thms3 active usersReviewed
Operations ResearchOptimal TransportStatistics·Captain: mikedeng1

Sample Out-of-Sample Inference Based on Wasserstein Distance: The Rescaled SOS Profile Function for Means Converges in Distribution to an Explicit Dimension-Dependent LimitResearch Paper

Stress testing and data-driven decision making often combine two samples: observations X1,…,XnX_1,\dots,X_nX1​,…,Xn​ of the quantity of interest and additional scenarios Y1,…,YmY_1,\dots,Y_mY1​,…,Ym​ (stress scenarios supplied by a regulator, or unlabeled data). Blanchet and Kang (arXiv:1605.01340v4, 2020; later in Operations Research, 2021) propose to measure how far the empirical…

14 thms3 active usersReviewed
Bandit AlgorithmsOperations ResearchStatistics·Captain: mikedeng1

Bayesian Sequential Learning for Clinical Trials of Multiple Correlated Medical Interventions: The cPDE Allocation Policy Is Asymptotically ConsistentResearch Paper

A clinical trial that compares several treatments for the same condition must decide, patient by patient, which treatment the next patient receives. When the treatments are related (doses of one drug, drugs of one class), an outcome observed on one arm is informative about the others, and a good allocation rule should exploit that correlation. Chick, Gans…

20 thms3 active users
🏆Completed
AnalysisEconomicsOperations Research·Captain: mikedeng1

The Challenge of Understanding What Users Want: Inconsistent Preferences and Engagement Optimization III: Whether Utility Rises with Session Length Is Decided by Span Versus MoreishnessResearch Paper

Platforms that rank content by engagement (time spent, items consumed) implicitly assume revealed preference: a user who stays longer is a user who is better off. Kleinberg, Mullainathan and Raghavan (arXiv:2202.11776, Management Science 2023, doi:10.1287/mnsc.2022.03683) model a user with inconsistent preferences, a forward-looking system 2 and an…

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 6: Under LIFO Issuance with m ≥ 2 and S^NP > D̲ > 0 the Best Base-Stock Policy Is Not Asymptotically Optimal as θ → ∞Research Paper

Blood platelets, fresh produce and many pharmaceuticals have a fixed lifetime: a unit not used within mmm periods of its arrival must be discarded. Optimal ordering for such products depends on the whole age profile of the stock, and the dynamic program that describes it has an (m−1)(m-1)(m−1)-dimensional state. It is intractable beyond small mmm (Nahmias, 1982;…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 7: With Backlogging and Positive Lead Times a Simple Base-Stock Policy Is Asymptotically Optimal in m, n and θResearch Paper

Blood platelets, fresh produce, dairy and many pharmaceuticals have a fixed shelf life: a unit that is not used within mmm periods of its arrival must be discarded. Managing such products is a classical problem of inventory theory (Nahmias 1982, Operations Research 30(4), doi:10.1287/opre.30.4.680). The optimal ordering policy depends on the entire age…

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 4: Under FIFO Issuance the Heuristic Base-Stock Policy Is Asymptotically Optimal as the Unit Outdating Cost GrowsResearch Paper

Blood platelets, fresh produce, bakery items and many pharmaceuticals have a fixed lifetime: a unit that is not used within mmm periods of arrival must be discarded. Replenishing such a product is a classical problem of inventory theory (Nahmias 1982), and its optimal policy depends on the whole age profile of the stock, so it cannot be computed for realistic…

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 5: Under LIFO Issuance a Simple Base-Stock Policy Has Gap ≤ 3θE[(S^NP−D)⁺]/(2m) and Is Asymptotically Optimal in p and θResearch Paper

Blood platelets, fresh food and many pharmaceuticals have a fixed lifetime: a unit that has not been used within mmm periods of its arrival must be discarded. A retailer of such a product faces the usual trade-off between leftover stock and lost sales, plus the cost of discarding outdated units. The issuance policy, the order in which units of different ages…

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

Information Design for Congested Social Services: Optimal Need-Based Persuasion 2: With Only Low-Need Users, Full Information Is Within a Factor of the Optimal Signaling MechanismResearch Paper

Social services such as public housing, food banks and free clinics are congested: the users who arrive wait in a queue they cannot see, and some of them could do almost as well elsewhere. A provider who sees the queue can decide what to tell arriving users about it. Telling low-need users that the queue is long sends them to their outside option and…

10 thms3 active usersReviewed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Information Design for Congested Social Services: Optimal Need-Based Persuasion 4: Signaling Achieves the First-Best Admission Policy for All Welfare Weights Above a ThresholdResearch Paper

Social services such as public health clinics, legal aid offices and food banks are congested: users wait in a queue whose length they cannot see. Some users have no alternative (high need) and others have an outside option (low need). A provider cannot price access, but can decide what to tell arriving users about the queue. Anunrojwong, Iyer and Manshadi…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 2: Under FIFO Issuance the Heuristic Base-Stock Policy's Optimality Gap Decays Exponentially in Demand Population SizeResearch Paper

Perishable products (blood platelets, fresh food, pharmaceuticals) have a fixed lifetime: units not sold within mmm periods expire and are discarded. Managing such inventory well is a classical problem in operations research, going back to Nahmias (1975). The difficulty is that the state of the system is the whole age profile of the stock, so the optimal…

15 thms3 active usersReviewed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 3: Under FIFO Issuance the Heuristic Base-Stock Policy Is Asymptotically Optimal as the Unit Penalty Cost GrowsResearch Paper

Perishable products, among them fresh food, blood platelets and pharmaceuticals, lose their value after a fixed number of periods. Their inventory control has been studied since the 1970s (Nahmias, Perishable inventory theory: a review, Operations Research 1982). The optimal policy of the standard lost-sales model depends on the whole age profile of the…

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

Information Design for Congested Social Services: Optimal Need-Based Persuasion 1: Every Pareto-Efficient Signaling Mechanism Has a Threshold Structure at or Below the Full-Information ThresholdResearch Paper

Many social services are rationed by waiting rather than by price: public health clinics, food banks, shelters, legal aid. Users who need the service most often have no outside option, while users with less need could be served elsewhere but join the queue anyway and lengthen everyone's wait. The provider usually cannot force anyone to leave, and charging…

6 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand I: The Approximation APT Bounds the Expected Cost-to-Go from Below and Above and Is Exact in the Last PeriodResearch Paper

Retailers and restaurants increasingly deliver orders from their own stores within an hour or less. Orders arrive throughout the day, a fixed pool of drivers is based at the store, and in each dispatch wave the operator must decide how many drivers to send out now and along which routes. Sending many drivers now gives short delivery times for the current…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Courier Dispatch in On-Demand Delivery I: With Exogenous Demand, Dedicated Delivery Has the Shorter Wait Exactly Below One Threshold in Demand Rate and in Service RadiusResearch Paper

On-demand delivery platforms for meals and groceries promise delivery within minutes, and the main operational lever they control is how a courier is dispatched. A courier can carry each order as soon as it is ready (dedicated delivery), or wait until two orders are available and deliver them in one trip (batch delivery). Batching saves travel per order but…

9 thms3 active usersReviewed
PreviousPage 35 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