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
Graph TheoryLinear OptimizationOperations Research+1·Captain: mikedeng1

Linear Programming and Community Detection 7: The LP Relaxation Fails w.h.p. in the Logarithmic-Degree SBMResearch Paper

The stochastic block model (SBM) is the standard benchmark for community detection: a random graph whose vertices are split into hidden communities, with denser connections inside a community than across. For two equal communities, the best possible estimator of the hidden partition is the minimum bisection problem, which is NP-hard in the worst case. Its…

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

Designing Approximately Optimal Search on Matching Platforms 2: Every Set of Assortments Has a Unique Profile of Thresholds Equal to Expected UtilitiesResearch Paper

Online matching platforms for dating, freelancing or ride sharing do not match agents themselves. They decide whom each agent gets to see and how often, and the agents then accept or reject. Immorlica, Lucier, Manshadi and Wei (arXiv:2102.09017, Management Science 2023) model this as directed search. The platform designs assortments, which are rates at…

8 thms2 active usersReviewed
🏆Completed
Graph TheoryOperations Research·Captain: mikedeng1

Load Balancing Under Strict Compatibility Constraints 2: Random Graphs with Server Degree c(N) → ∞ and Nc(N)/(M(N) ln N) → ∞ Are Almost Surely Proportionally Sparse and SubcriticalResearch Paper

In large data centres, an incoming task often cannot run on every server: its data, software or licences sit on only some of the machines. Such strict compatibility constraints are modelled by a bipartite graph between task types (dispatchers) and servers. For the fully flexible system, in which every task can go to every server, the JSQ(ddd) policy (sample ddd…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Secretary Problems with Biased Evaluations Using Partial Ordinal Information II: No Algorithm Beats Competitive Ratio ω on Posets of Width ωResearch Paper

In hiring, admissions and procurement, candidates are often judged by scores that are known to be biased: two candidates from different groups, schools or evaluation pipelines cannot be compared by their observed scores, while two candidates from the same pipeline can. Salem and Gupta (SSRN 3444283, published in Management Science, 2023) model this…

8 thms2 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research·Captain: mikedeng1

Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities: Rounding LP-Match Online Earns 0.51 of the Optimal Online AlgorithmResearch Paper

Ride hailing, online advertising and kidney exchange share a decision problem: resources that are present from the start must be matched, irrevocably and one at a time, to requests that arrive at random. When the arrival probabilities are known in advance, the natural benchmark for an online algorithm is not the offline optimum (the "prophet", who sees…

21 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Selection and Ordering Policies for Hiring Pipelines via Linear Programming 2: An LP-Rounding Policy That Sends Offers in Parallel Lists Earns at Least (1 − 1/e) Times the LP BoundResearch Paper

Firms that hire for several roles at once face a timing problem. An offer occupies a candidate until they answer, a candidate can hold only one offer, and the hiring season has a fixed number of decision rounds. Sending offers one at a time is slow; sending them all at once risks over-hiring. Epstein and Ma (arXiv:2210.04059v3, Operations Research 2024)…

8 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge: The Profit-Maximizing Price and Induced Arrival Rates Under High DemandResearch Paper

A seller with scarce stock may offer a product before its main selling period. This gives buyers another chance to obtain it, but it can also alter when they compete for the stock. The seller must choose a price while anticipating that buyers respond to both the price and the chance that the unit will already be gone. Glazer, Hassin, and Nowik study this…

11 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations ResearchOptimization·Captain: mikedeng1

Intertemporal Price Discrimination via Randomized Promotions: A Two-Point Price Distribution Is Optimal for Randomized Pricing with Two Customer SegmentsResearch Paper

Retailers that run predictable promotions teach their customers to wait for them. A customer who knows that a discount will come next week has no reason to buy at the list price today. Firms therefore lose margin on exactly the customers who would have paid in full. One response, documented in practice by Moon, Bimpikis and Mendelson (2017), is to randomize…

8 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research+1·Captain: mikedeng1

Partial Vertical Ownership, Capacity Investment, and Information Exchange in a Supply Chain II: Truthful Cheap Talk Is an Equilibrium Iff the Ownership Share β Is at Least β̳Research Paper

A supplier who must build capacity before a selling season would like to know how large demand will be, and the retailer downstream often knows better. Under a simple wholesale-price contract, however, the retailer gains from overstating demand: more capacity means more sales for her, and the cost of idle capacity falls on the supplier. Since the retailer's…

8 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

Partial Vertical Ownership, Capacity Investment, and Information Exchange in a Supply Chain I: Under Complete Information the Retailer Finances the Entire Capacity Iff β ≥ β̲, and β̲ < 1Research Paper

Firms in a supply chain often hold equity in one another. A retailer may own a minority stake in a supplier without controlling it: the stake is passive, but it changes what the retailer cares about, because part of the supplier's profit now accrues to her. Avinadav and Shamir (Management Science, 2023) study how such partial vertical ownership (PVO) affects…

9 thms2 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOperations Research·Captain: mikedeng1

A Dynamic Model for Managing Volunteer Engagement II: The Bellman Solution in Closed Form Between Consecutive Engagement ThresholdsResearch Paper

Non-profit organizations such as food banks run on volunteer labour. Volunteers sign up for shifts, wait on a sign-up list, work, rest, and may or may not return; the organization can spend money on engagement activities (reminders, recognition events, recruitment drives) that raise the rate at which volunteers come back or arrive. Spending too little…

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

Operational Risk Management: Optimal Inspection Policy II: The Optimal Hybrid Inspection Policy Strictly Beats the Random Policy and Weakly Beats the Periodic PolicyResearch Paper

Banks and other financial firms lose money through operational errors: mistyped trades, missed reconciliations, compliance lapses. Regulators require the firm to hold capital against these losses, and internal audit teams spend most of their effort deciding when to inspect. Two inspection schedules are common in practice: a periodic schedule (inspect every…

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

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality I: Feasible Solutions of the Continuous Stopping LP Can Be Improved to Threshold FormResearch Paper

Two classical online selection problems sit at opposite ends of an information spectrum. In the secretary problem items arrive in uniformly random order, only their relative ranks are observed, and the best possible probability of stopping on the best item tends to 1/e1/e1/e. In the i.i.d. prophet inequality the values are independent draws from a known distributi…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Pricing in On-Demand and One-Way Vehicle-Sharing Networks 2: With Workload Budget K, Static Prices Earn a Demand-Independent 1 − O(1/√K) Fraction of the Fluid OptimumResearch Paper

One-way vehicle-sharing systems (car sharing, bike sharing, ride-hailing fleets) set a price for every origin–destination trip. Prices decide which trips are taken, and so they decide where vehicles end up. Pricing that depends on the current position of every vehicle is in principle optimal, but its state space grows combinatorially with the fleet.…

11 thms2 active usersReviewed
🏆Completed
Graph TheoryInformation TheoryStatistics·Captain: mikedeng1

Partial Recovery in the Graph Alignment Problem I: If D(P‖Q)/α = o(log n/n), No Algorithm Recovers a Fraction α of a Correlated Erdős–Rényi AlignmentResearch Paper

Graph alignment asks for the correspondence between the vertices of two graphs that are noisy copies of each other with hidden labels. It arises in the de-anonymization of social networks, where an anonymized friendship graph is matched against a public one (Narayanan–Shmatikov 2009), and in computational biology, where protein–protein interaction networks…

8 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Secretaries with Advice 1: Under Non-Filtering and History-Irrelevance, an Optimal Stopping Policy Is MemorylessResearch Paper

In the classical secretary problem, nnn candidates arrive one at a time in random order; at each arrival the decision maker sees only how the current candidate compares with the earlier ones, and must irrevocably hire or pass. The goal is to hire the best candidate, and the optimal rule (wait for about n/en/en/e arrivals, then take the first candidate better than…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex Optimization·Captain: mikedeng1

Persuading Risk-Conscious Agents: A Geometric Approach I: The Sender's Persuasion Problem Is Solved by a Convex Program over Conv(P_a ∪ {0})Research Paper

Bayesian persuasion studies a sender who observes a state of the world and commits in advance to a randomized disclosure rule, in order to influence the action of a receiver who updates her belief by Bayes' rule. Since Kamenica and Gentzkow (2011) the model has been applied to platform design, recommendation systems, queue information and rating systems.…

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

Economics of Permissioned Blockchain Adoption II: A Self-Financing Consumer Access Fee Sustains Full Blockchain Adoption for Large Horizontal DifferentiationResearch Paper

A permissioned blockchain is a shared ledger to which only approved participants may write. In supply chains it is proposed as a way to make product information (origin, quality, which supplier fulfilled an order) verifiable to buyers. Iyengar, Saleh, Sethuraman and Wang (SSRN 3602376; Management Science 2023, doi:10.1287/mnsc.2022.4532) ask who gains from…

10 thms2 active users
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Lightning Network Economics: Topology III: With Power-Law Channel-Cost Tails, a Random Lightning Network Is Hermetizable with High ProbabilityResearch Paper

The Lightning Network is a payment layer built on top of Bitcoin: pairs of participants lock funds in a bilateral payment channel and then exchange payments off-chain, settling on the blockchain only occasionally. Keeping a channel open costs money, because it ties up capital and needs periodic rebalancing, and Guasoni, Huberman and Shikhelman (Lightning…

9 thms2 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Lambda Value-at-Risk under Ambiguity and Risk Sharing III: Comonotonic Risk Sharing of Nonnegative ΛVaRs under Continuous Capacities Gives All the Risk to the Agent with the Smallest ΛVaRResearch Paper

Quantile-based risk measures are the regulatory standard in banking and insurance, and Lambda Value-at-Risk (ΛVaR), introduced by Frittelli, Maggis and Peri (2014), generalises Value-at-Risk by letting the confidence level vary with the loss: large losses can be judged at a stricter level than small ones. When several agents (desks of a bank, members of a…

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

Opinion Dynamics on Directed Complex Networks 2: Without Memory on a Galton-Watson Limit, E[R*] = dE[Z_∅] + cE[Z_1] and Var(R*) = d²Var(Z_∅) + ρ*₂d²Var(Z_1)/(1 − ρ₂)Research Paper

Linear opinion models describe each individual's opinion as a weighted average of the opinions of the people they listen to, of an outside signal, and of their own previous opinion. The model goes back to DeGroot (DeGroot 1974) and Friedkin–Johnsen, and its basic questions are when a population reaches consensus and when it polarizes. Fraiman, Lin and…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 5: In a Large Supply-Rich Market, a Driver-to-Vehicle Ratio of 1/α Asymptotically SufficesResearch Paper

Tele-driving separates a ride-hailing driver from the vehicle: a remote driver operates a car over a wireless link, and on finishing a trip can immediately take control of another car anywhere in the service region. Several companies have run pilots of this model; Benjaafar, Wang and Yang cite Vay's car-sharing service operated by tele-drivers and Halo's…

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

Human in the Loop Automation: Ride-Hailing with Remote (Tele-)Drivers 4: In a Large Intermediate Market, Remote Drivers Bring No Asymptotic Service-Level GainResearch Paper

In a conventional ride-hailing system every vehicle needs its own driver. Tele-driving, in which a vehicle is driven by a remote operator over a network, separates the two: a pool of nnn remote drivers can serve a fleet of m≥nm \ge nm≥n vehicles, each driver taking control of an idle vehicle near the next customer. Fewer drivers mean lower labor cost, but also…

6 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design III: Against Exchangeable or Arbitrary Joint Valuations the Minimax Regret Is 1/e for Every nResearch Paper

A seller with one item faces nnn buyers whose valuations she does not know, not even in distribution. Prior-independent mechanism design asks which selling mechanism performs well against every distribution in a given class, rather than against one known prior. Anunrojwong, Balseiro and Besbes (arXiv:2204.10478v5, Operations Research 2025) measure performance…

8 thms2 active usersReviewed
🏆Completed
Actuarial ScienceOperations Research·Captain: mikedeng1

Lambda Value-at-Risk under Ambiguity and Risk Sharing I: For Increasing Λ, the Worst-Case ΛVaR over a φ-Divergence Ball Is the ΛVaR under the Distorted Capacity g∘ℙ, and Tends to ΛVaR⁺ as δ ↓ 0Research Paper

Lambda Value-at-Risk (Λ\LambdaΛVaR), introduced by Frittelli, Maggis and Peri (Mathematical Finance 24(3), 2014), generalizes the Value-at-Risk used in banking and insurance regulation: instead of one fixed confidence level, the level Λ(x)\Lambda(x)Λ(x) may depend on the size xxx of the loss. It has since been studied for its properties, representation and…

6 thms2 active usersReviewed
PreviousPage 44 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