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

Approximation and Convergence of Large Atomic Congestion Games: Equilibria of Bernoulli Congestion Games Converge to Poisson Flows Whose Means Are Wardrop Equilibria of a Limit GameResearch Paper

Traffic models in transportation and network design come in two kinds. Nonatomic congestion games, with Wardrop equilibria, treat traffic as a continuum of infinitesimal users. Atomic games have finitely many players, each with a non-negligible effect on congestion. The Wardrop model is the one used in practice, and the usual justification is that it is the…

14 thms4 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk II: Dual Representation of Acceptability FunctionalsTextbook

Risk functionals assign a number to an uncertain profit and are used as objectives and constraints in portfolio selection, insurance and energy planning. Since the axiomatization of coherent risk measures by Artzner, Delbaen, Eber and Heath (Math. Finance 1999), the standard way to understand such a functional is through a dual representation: the…

9 thms4 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: Shuze Chen

Stochastic Networks X: Stationary Open Migration Processes Under Time ReversalTextbook

A network of queues records both how many customers occupy each location and how they move between locations. These are different kinds of information. A simple distribution for the occupancies at one time need not make the arrival streams simple, or make the queues independent over time. Open migration processes provide a setting in which the distinction…

10 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Role of Risk Aversion in Price Postponement Under Supply Random Yield: Ex Ante and Responsive Pricing Share One CVaR Risk-Aversion ThresholdResearch Paper

Many manufacturing processes deliver only a random fraction of what they start: semiconductor wafers, biologics, agricultural produce and recycled materials all suffer random yield. A firm facing yield risk has two classical levers. It can inflate production to hedge against low yield, and it can postpone pricing until the yield is observed, so that the…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Gradient-Based Algorithms for Convex Discrete Optimization via Simulation: Truncated Stochastic Subgradient Descent with Rounding Finds an (ε, δ)-Good Solution of Stochastic Submodular MinimizationResearch Paper

Many operations decisions are made over discrete, high-dimensional choices whose cost can only be estimated by simulation: how many bikes to place at each station, which subset of facilities to open, how to allocate servers in a queueing network. Each evaluation of a candidate decision is a noisy run of a simulator, and the goal is to select a decision…

15 thms4 active usersReviewed
🏆Completed
Machine Learning·Captain: mikedeng1

Speculative Actions: A Lossless Framework for Faster Agentic Systems: Exact Expected Runtime Ratio of k-Branch Speculation Under Exponential LatenciesResearch Paper

An agentic system may make several slow API calls in sequence: the answer to one call determines what to request next. A speculator can guess the current answer while the real call is running and start likely next calls early. When a guess is correct, the system can reuse a pending result; when it is wrong, it discards that result. This can shorten a run if…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchReinforcement LearningStatistics·Captain: mikedeng1

Correcting for Interference in Experiments: A Case Study at Douyin: In Absorbing MDPs the Differences-in-Qs Estimator Has Bias at Most T_abs³ · r_max · δ²Research Paper

A creator-side experiment on a short-video platform may assign treatment to individual videos while measuring outcomes over a viewer's whole session. A treated video can alter what the viewer watches next, so its effect may persist beyond the immediate reward. The paper studies this form of interference using a Markov decision process and asks how well data…

10 thms4 active usersReviewed
🏆Completed
Linear algebraMarkov ChainNumerical Analysis+2·Captain: Shuze Chen

Introduction to Matrix Analytic Methods in Stochastic Modeling VII: G, U and R as Minimal Nonnegative SolutionsTextbook

A quasi-birth-and-death process (QBD) is the Markov chain behind queues with phase-type service or arrivals, priority queues, and many models of telecommunication and inventory systems: a level that moves up or down by at most one per step, and a phase that carries the rest of the state. Its stationary distribution is determined by three matrices indexed by…

19 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchOptimization+1·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices X: Jobs and Targets, Location–Scale Invariance and Semi-Markov Sampling ProcessesTextbook

A bandit sampling process models a population from which values are drawn one at a time: the values are independent with a distribution f(⋅∣θ)f(\cdot \mid \theta)f(⋅∣θ) whose parameter θ\thetaθ is unknown, the decision maker holds a prior on θ\thetaθ and updates it by Bayes' theorem, and each draw earns a reward. When several such populations compete for the same sampling…

11 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsDynamic ProgrammingLinear Optimization+2·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices IX: Suboptimality Bounds for Branching Bandits and Index Policies on Parallel MachinesTextbook

Gittins index policies are optimal for a single server choosing among alternative bandit processes, and the achievable region method of Bertsimas and Niño-Mora (Math. Oper. Res. 1996) explains why: when the performance vectors of a scheduling system satisfy generalized conservation laws, the region they fill is a polytope whose optimal vertex is an index…

11 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: Shuze Chen

Average Cost Markov Decision Processes with Weakly Continuous Transition Probabilities: Assumptions (W*) and (B̲) Give the Average Cost Optimality Inequality and a Stationary Optimal PolicyResearch Paper

A Markov decision process (MDP) with the average cost per unit time criterion models a controller who runs a stochastic system indefinitely and cares about long-run cost rather than any finite horizon: inventory control, queueing control, and maintenance are standard examples. The basic questions are whether an optimal policy exists, whether it can be taken …

15 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

When Should the Off-Grid Sun Shine at Night? Optimum Renewable Generation and Energy Storage Investments: Storage Pays iff c_K/e < g − √(2c_Q g), So Technologies Rank by Cost-to-Efficiency RatioResearch Paper

Islands, remote villages and mining sites that are not connected to a power grid have traditionally run on diesel generators. Solar panels can replace part of that fuel, but the sun shines only during the day, and demand continues at night. Pairing solar capacity with energy storage lets daytime surplus serve nighttime demand, at the price of an additional…

11 thms4 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Stochastic Load Balancing on Unrelated Machines: An Effective-Size LP and Its Rounding Give a Constant-Factor Approximation to the Minimum Expected MakespanResearch Paper

Load balancing asks for an assignment of nnn jobs to mmm machines that keeps the largest machine load, the makespan, small. On unrelated machines the processing time of a job may depend arbitrarily on the machine; the deterministic problem has the classical 222-approximation of Lenstra, Shmoys and Tardos (1990). In many applications (virtual-circuit routing,…

16 thms4 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Insider Trading, Competition, and Real Activities Manipulation: With Subsequent Kyle Insider Trading, a Monopoly Has a Unique Linear Equilibrium, with Output E[a|s]/2 + (1/(4ω))√(ΣuΣaΣθ/(Σa+Σθ))Research Paper

Managers who run a firm also trade its stock. Accounting and finance research has long asked how the opportunity to trade on private information changes what managers do inside the firm. Real activities manipulation means that a manager distorts operating choices (production, investment, discretionary spending) rather than accounting numbers. The usual…

9 thms4 active usersReviewed
🏆Completed
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

Simulating Large Quantum Circuits on a Small Quantum Computer: A (K, d)-Clustered Circuit Is Simulated to Precision ε with Probability 2/3 by O(2^{4K} r/ε²) Runs of d-Qubit PiecesResearch Paper

Near-term quantum processors have few qubits, while the circuits one would like to run (variational eigensolvers, sampling benchmarks, error-mitigated algorithms) often need more qubits than any single device has. Peng, Harrow, Ozols and Wu (arXiv:1904.00102, Phys. Rev. Lett. 125, 150504, 2020) show that a circuit which is only loosely connected (a few…

16 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Better to Bend than to Break: Sharing Supply Risk Using the Supply-Flexibility Contract: With Log-Concave Demand, Both Supplier and Buyer Are Better Off than under the Price-Only ContractResearch Paper

A supplier whose regular production can be disrupted must decide who bears the risk of a shortfall. Under a price-only contract the supplier promises the full order and covers any shortfall from a costlier, reliable expedited source; the buyer bears no supply risk but pays for the supplier's insurance through the wholesale price. Farahani, Dawande, Gurnani…

18 thms4 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination: The Partial Identification Set of Demographic Disparity Is the Closed Interval with Fréchet–Hoeffding EndpointsResearch Paper

An auditor may need to measure whether a decision rule approves members of one protected group more often than members of another. The decision, the relevant outcome, and useful proxy variables may be observed in a primary dataset, while protected class and the same proxies are observed in a separate auxiliary dataset. There is no record linking the two…

8 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Information Provision and Farmer Welfare in Developing Economies: Giving the Public Signal to One Farmer or to None Maximizes Total Farmer WelfareResearch Paper

Farmers who sell the same crop can benefit from better forecasts of the market price, but their production decisions also affect one another through the price. A forecast sent to one farmer may improve that farmer’s decision; a forecast sent to many farmers can make their output responses move together. A planner choosing who receives a common forecast…

20 thms4 active users
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Joint vs. Separate Crowdsourcing Contests: The Separate Contest Has the Higher Expected Best Random Factor, and the Joint Contest Induces Higher Equilibrium EffortResearch Paper

Firms increasingly outsource innovation to crowdsourcing contests: a firm posts a design or software problem, many independent solvers submit solutions, and the best one wins a prize. Platforms such as Topcoder, 99designs and Kaggle run thousands of such contests, and a recurring design question is whether a project with several attributes (say, a logo's…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

We Are on the Way: Analysis of On-Demand Ride-Hailing Systems: In the One-Direction Approximation, the No-Call Mechanism Never Has a Longer Average Waiting Time Than the Call MechanismResearch Paper

On-demand ride-hailing platforms replaced street-hailing on the promise that matching a passenger to a car at the moment of the request shortens the wait. Feng, Kong and Wang (SSRN 2960991, later published in Manufacturing & Service Operations Management, doi:10.1287/msom.2020.0880) ask whether that is true in a stylized model and find that it need not be:…

14 thms4 active users
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Secretary Problems with Biased Evaluations Using Partial Ordinal Information I: ProxyLabel with a Width Estimate ω′ ≥ ω/c Is e^c(ω′+1)/(1−1/k)^{k−1}-CompetitiveResearch Paper

In the classical secretary problem, candidates arrive one at a time in uniformly random order, and a decision maker must accept or reject each one irrevocably. The decision maker sees exact scores, or at least a total ranking of the candidates seen so far. In hiring, admissions and procurement the observed scores are often biased: evaluations of candidates…

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

Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources II: The Max-Weighted-Service Policy Is Almost Surely Asymptotically OptimalResearch Paper

Firms that serve several customers from shared capacity, such as a warehouse supplying several retailers, a flexible production line building several products, or an assemble-to-order system, often sign contracts that guarantee each customer an individual service level. Typical targets are the probability of filling a customer's whole demand (Type-I), the…

11 thms4 active usersReviewed
🏆Completed
Quantum InformationStatistics·Captain: mikedeng1

Direct Fidelity Estimation from Few Pauli Measurements 1: ⌈1/(ε²δ)⌉ Importance-Sampled Pauli Measurements Estimate tr(ρσ) Within 2ε With Probability ≥ 1 − 2δResearch Paper

Experiments that prepare many-body entangled states (GHZ, W, stabilizer, cluster and matrix product states) need a way to check that the device produced the intended state. Full quantum state tomography answers the question but its cost grows with the dimension d=2nd = 2^nd=2n of an nnn-qubit system: a reconstruction needs on the order of d2d^2d2 measurement settings.…

15 thms4 active usersReviewed
🏆Completed
EconomicsOperations ResearchStochastic Systems·Captain: mikedeng1

Providing Data Samples for Free: Free Samples Strictly Beat Selling in One Round When the Seller-Side Drift of the Buyer's Bayes Risk Is Initially PositiveResearch Paper

Firms that own data increasingly sell it as a product: market research panels, consulting reports, datasets for training demand models. A common commercial practice is to hand out a free sample of the data before quoting a price for the rest. Under standard Bayesian reasoning this practice looks self-defeating. Every free data point reduces the buyer's…

16 thms4 active users
🏆Completed
Markov ChainOperations ResearchReinforcement Learning·Captain: mikedeng1

Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds I: An Extended MDP with δ-Optimistic Samples for Hitting Times Has Diameter at Most D/(1−δ)Research Paper

Regret bounds for reinforcement learning in a single, non-episodic Markov decision process (MDP) are stated in terms of the diameter DDD of the MDP: the worst expected time needed to travel between two states when the travel policy is chosen well. UCRL2 (Jaksch, Ortner and Auer, 2010) achieves regret O~(DSAT)\tilde O(DS\sqrt{AT})O~(DSAT​), against a lower bound of …

6 thms4 active usersReviewed
PreviousPage 8 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