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

Convergence and Stability of Coupled Belief–Strategy Learning Dynamics in Continuous Games: Beliefs and Strategies Converge Almost Surely to a Payoff-Consistent Equilibrium Fixed PointResearch Paper

Many strategic systems learn two things at once. Travellers on a road network, firms in a market or bidders in an auction adjust their strategies to each other, and an information platform (a navigation service, a market maker, a public agency) estimates an unknown parameter of the environment from the payoffs those strategies produce. The payoffs are…

22 thms1 active userReviewed
Linear OptimizationOperations Research·Captain: iris

Column-Randomized Linear Programs: Performance Guarantees and Applications: with probability ≥ 1 − δ, Δv(P_J) ≤ Δv(P_distr) + C(1 + mγ‖A‖max)(1 + √(2 log(2/δ)))/√KResearch Paper

Many linear programs in operations research have a small number mmm of constraints and an astronomically large number nnn of columns: cutting-stock patterns, rankings in nonparametric choice estimation, state–action pairs of a Markov decision process. The standard remedy is column generation, which needs a problem-specific pricing subproblem. Akchen and Mišić (a…

12 thms1 active userReviewed
Mechanism DesignOperations Research·Captain: iris

Dynamic Development Contests: Probabilistic Change-of-State Disclosure Minimizes the Expected Lead Time of a Budget-Constrained ContestResearch Paper

Governments and firms often buy development work through contests: suppliers race through milestones, and the first to finish gets a prize. Such contests stall when a supplier learns that it has fallen behind and stops working, so the organizer's control over what suppliers learn is a design lever alongside the prize. Khorasani, Körpeoğlu and Krishnan study…

22 thms1 active userReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: iris

Multiplayer Bandits Without Observing Collision Information: A Decentralized Algorithm Has Expected Regret O(mK log(T)/Δ²)Research Paper

In cognitive radio networks, several radios share a set of frequency channels. Each radio picks a channel in every time slot. The quality of a channel is random and unknown, and two radios that pick the same channel interfere and transmit nothing. This is the multiplayer multi-armed bandit problem: mmm players repeatedly choose among KKK arms, an arm pays a…

16 thms1 active userReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: iris

Bayesian and Randomized Clock Auctions: A Deterministic Single-Price Clock Auction Achieves an O(log⁡log⁡k)O(\log\log k)O(loglogk)-Approximation to the Expected Optimal WelfareResearch Paper

A seller offers a service to a set of buyers, each with a private value, and a feasibility constraint limits which sets of buyers can be served together. This is the basic single-parameter problem of mechanism design. Milgrom and Segal proposed clock auctions for it, and designed one for reallocating radio frequency licenses (Milgrom and Segal 2020). In a…

21 thms1 active userReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Mean Field Contest with Singularity: the stopping contest has a unique mean field equilibrium, given in closed formResearch Paper

Rank-based rewards are the standard incentive in sales tournaments, research prizes and promotion contests. Seel and Strack (Gambling in contests, J. Econ. Theory 2013) showed that such contests can be analysed as games of risk taking, in which each player chooses when to stop a privately observed diffusion. Nutz and Zhang (Reward design in risk-taking…

17 thms1 active userReviewed
Dynamic ProgrammingLinear OptimizationOperations Research·Captain: iris

On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs: No Duality Gap Under MajorizationResearch Paper

A Markov decision process (MDP) with the average-cost criterion asks for a policy that minimizes the long-run expected cost per stage. A classical way to solve it is linear programming: the optimal average cost is the value of a linear program over occupation measures (probability measures on state–action pairs that are invariant under the dynamics), and…

25 thms1 active userReviewed
Algorithmic Game TheoryGraph TheoryOperations Research·Captain: iris

Continuous Patrolling Games: On Every Network, Attacks No Longer Than the Generalized Girth Have Value α/(μ + lα/2), Attained by the Leaf-Pausing Double Tour and the Independent AttackResearch Paper

A security agency guards a network of roads, pipelines or corridors against an infiltrator who needs a fixed amount of uninterrupted time at one spot to do damage. The agency moves a single patroller at bounded speed and wants to maximize the probability of catching the attack in progress. Patrolling games model this as a zero-sum game between a Patroller…

27 thms1 active userReviewed
Mechanism DesignOperations Research·Captain: iris

Optimal Relative Performance Criteria in Mean-Field Contribution Games: The Two-Layer Game Has an Equilibrium with the Unique Team-Wise Equilibrium and an Explicit Optimal Ratio-Based RPCResearch Paper

When a team's reward depends on the total effort of its members and the reward is shared equally, every member bears her own effort cost but receives only a small share of what that effort adds. With a continuum of members, each member's effort has no effect on the shared reward, so in a Nash equilibrium nobody works: the extreme case of free riding. Firms,…

19 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: iris

Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs: a quadratic-cost cμ-rule decides between prioritizing either of two types and pooling them under FCFSResearch Paper

A service system that sees several types of customers must decide whom to serve first. When the cost of waiting grows linearly in the wait, the answer has been known since Cox and Smith (1961): serve the types in decreasing order of ciμic_i\mu_ici​μi​, the waiting-cost rate times the service rate. This cμc\mucμ-rule is a fixed priority ordering, and under it serving all…

18 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: iris

Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling: the steady-state mean of linear combinations of queue lengths in a generalized switch under MaxWeightResearch Paper

Scheduling a shared resource among many queues is the basic control problem of communication networks, data centers and input-queued switches. MaxWeight is the standard policy: it is throughput optimal, and it needs no knowledge of the arrival rates. Exact steady-state analysis is hopeless for such systems, so performance is studied in heavy traffic, as the…

13 thms1 active userReviewed
Dynamical SystemsOperations Research·Captain: iris

Dense Orbits of the Bayesian Updating Group Action: with at least as many signals as states, a generic signalling structure makes the orbit of every interior prior dense in the simplexResearch Paper

A decision maker holds a prior over a finite set of states, observes a signal, and moves to a posterior by Bayes' rule. Repeating this step is the standard model of learning in decision theory and in repeated games of incomplete information. Hellman and Levy (Dense Orbits of the Bayesian Updating Group Action) study this process through topological…

7 thms1 active userReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: iris

Optimal Abort Policy for Mission-Critical Systems Under Imperfect Condition Monitoring: Erlang-Surrogate POMDP Policies Converge Almost Surely to the Optimal Abort RulesResearch Paper

Unmanned aerial vehicles, spacecraft and other mission-critical systems carry a sensor that reports their health imperfectly. While a mission runs, an operator must decide at each sampling epoch whether to abort and pay a mission failure cost, or to continue and risk losing the system. A wrong decision in either direction is expensive, and the decision has…

46 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: iris

Generalized Exact Scheduling: A Minimal-Variance Distributed Deadline Scheduler: Generalized Exact Scheduling minimizes stationary capacity variance plus soft demand and deadline penaltiesResearch Paper

Systems that serve jobs with deadlines and can adjust their capacity on the fly, such as electric-vehicle charging stations and cloud data centers, pay for both the level and the volatility of the resource they draw. A charging station that buys energy on the day-ahead market needs a predictable power draw, and peaks strain the grid. Nakahira, Ferragut and…

12 thms1 active userReviewed
EconomicsOperations Research·Captain: iris

Double Marginalization Because of External Financing: Capacity Investment Under Uncertainty: with no bankruptcy option the lender charges rβ₁/(β₁−1) > r and the firm invests 1/(2η(β₁+1))Research Paper

Most real-options models of capacity investment assume that the firm finances the outlay at the risk-free rate, or that capital comes from a competitive market. Many firms, in particular young and small ones, have no equity and borrow from a lender with market power. Huberts, Wen, Dawid, Huisman and Kort (Management Science, 2025) model this as a dynamic…

9 thms1 active userReviewed
Operations ResearchOptimizationStatistics·Captain: iris

Stability and Sample-Based Approximations of Composite Stochastic Optimization Problems: Smoothed and Mixed Composite Estimators Converge Almost Surely in Objective, Optimal Value and SolutionsResearch Paper

Many risk measures used in stochastic optimization are not expectations of a single function but composite functionals: expectations nested inside one another. The mean–semideviation of order ppp, E[X]+κ (E[(X−EX)+p])1/p\mathbb E[X]+\kappa\,\bigl(\mathbb E[(X-\mathbb E X)_+^p]\bigr)^{1/p}E[X]+κ(E[(X−EX)+p​])1/p, and higher-order inverse risk measures are of this form. When the law of the data is known…

24 thms1 active userReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: iris

Finite-Memory Strategies in POMDPs with Long-Run Average Objectives: Every Finite POMDP with Liminf-Average Payoff Admits an ε\varepsilonε-Optimal Finite-Memory Strategy for Every ε>0\varepsilon > 0ε>0Research Paper

A partially observable Markov decision process (POMDP) models a controller that acts on a system whose state it cannot see: it observes only signals correlated with the state. POMDPs are the standard model for planning under uncertainty in robotics, machine maintenance, medical decision-making and verification of probabilistic systems. When the controller…

34 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: iris

Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone: Derivatives of Stationary Expectations via the Joint RBM-Derivative ProcessResearch Paper

Reflected Brownian motion (RBM) in a polyhedral cone arises as the heavy-traffic limit of open queueing networks (Reiman, 1984). Sensitivities of its stationary distribution to the drift, the covariance and the directions of reflection are relevant in those applications. There are few results on them. Dieker and Gao (2014) treat orthants with M-matrix…

72 thms1 active userReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Percolation Games: in i.i.d. oriented percolation games the nnn-stage value converges almost surely to a constant, with sub-Gaussian deviations at rate (ln⁡n/n)1/2(\ln n/n)^{1/2}(lnn/n)1/2Research Paper

Percolation games were introduced by Garnier and Ziliotto (arXiv:2110.12227, published in Mathematics of Operations Research, 2022) as discrete toy models for the stochastic homogenization of non-convex Hamilton–Jacobi equations. In homogenization one asks whether a control or game problem in a random, spatially varying environment behaves, over long…

13 thms1 active userReviewed
Algorithmic Game TheoryBandit AlgorithmsOperations Research·Captain: iris

Fair Exploration via Axiomatic Bargaining: PF-UCB Attains the Nash Social Welfare Upper Bound Y*(I) in Every Grouped K-Armed BanditResearch Paper

Many learning systems serve several populations at once: a recommender serves user segments, a clinical dosing rule serves patient subgroups, an online marketplace serves customer types. When these populations share the same unknown options, the exploration one population performs also informs the others. A policy that minimizes total regret decides who…

21 thms1 active userReviewed
Dynamic ProgrammingEconomicsOperations Research·Captain: iris

Scarcity of Ideas and Optimal R&D Policy: When the Arrival Rate of Ideas Is Unknown, the Optimal Reward Increases to v/r With Delay While Social Welfare DecreasesResearch Paper

Prizes and patents reward the first innovator to fill a market niche. How generous the reward should be depends on how often useful ideas arrive, and a policy maker rarely knows that rate. Basov, Erkal, Minehart and Scotchmer (SSRN 4628270, 2024; published in Management Science, doi:10.1287/mnsc.2023.03362) model ideas as scarce: they arrive at the times of…

24 thms1 active userReviewed
Markov ChainOperations ResearchReinforcement Learning·Captain: iris

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP: The Trajectory-Based Algorithm Drives the Truncated and Untruncated Cost Gradients to Zero Almost SurelyResearch Paper

The risk-sensitive exponential cost of a Markov chain replaces the long-run average of the one-step cost by the exponential growth rate of the expected exponential of the accumulated cost. It penalizes rare sample paths with high cost, and it goes back to Howard and Matheson (1972). For a finite chain the growth rate is the logarithm of a Perron eigenvalue (…

19 thms1 active userReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Random Perfect Information Games: The Distribution Function of the Value Is the Smallest Fixed Point of the Value Generating FunctionResearch Paper

The extinction probability of a branching process is the smallest fixed point of its offspring generating function, a classical result in the theory of branching processes (Athreya and Ney, 1972). Flesch, Predtetchinski and Suomala (arXiv:2104.10528) ask what becomes of this fact when the tree is contested. Two players choose the path through a random tree,…

13 thms1 active userReviewed
Operations ResearchStochastic Systems·Captain: iris

Reducing Bias in Event Time Simulations via Measure Changes: the exponential density has unit mean and tilts every point-process intensity by u (corrected: sequential independence)Research Paper

Event timing models describe when defaults, insurance claims or component failures occur. Each event iii arrives at the first time its integrated hazard Hti=∫0thsi dsH^i_t=\int_0^t h^i_s\,dsHti​=∫0t​hsi​ds crosses an independent exponential threshold, and the hazard rates may depend on the history of all events (contagion). Expectations E(f(N))\mathbf E(f(N))E(f(N)) of path functionals of the event…

11 thms1 active userReviewed
Operations ResearchOptimizationStochastic Systems·Captain: iris

A Class of Recursive Optimal Stopping Problems with Applications to Stock Trading: The Recursive Value Is the Unique Fixed Point in Ad\mathcal A_dAd​ and the First Contact Time Is OptimalResearch Paper

In a classical optimal stopping problem the reward collected at the stopping time is a fixed function of the state. Many decisions do not have this shape: an agent may commit to an uncertain option whose outcome is revealed only after a random delay, and if it fails the agent is back where it started and must decide again. The reward of committing then…

31 thms1 active userReviewed
PreviousPage 42 of 48Next

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