Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Optimization

2,311 missions · 1,728 completed

Missions

Open583Completed1728All2311
🏆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
Operations ResearchReinforcement Learning·Captain: Shuze Chen

Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization: Global linear convergence of exact natural policy gradientResearch Paper

A decision maker repeatedly chooses an action, receives a reward, and moves to another state. A policy specifies how to randomize the next action in each state. Optimizing these choices directly is a central approach to reinforcement learning, but the resulting objective need not be concave in its policy parameters. A useful convergence guarantee must…

19 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Robust Optimization VII: Exact Robust LMIs with Norm-Bounded UncertaintyTextbook

A design constraint may require a symmetric matrix to remain positive semidefinite even when some of its coefficients are uncertain. Such constraints arise in the structural design problems discussed in Chapter 8 of Ben-Tal, El Ghaoui and Nemirovski, Robust Optimization. A design that satisfies a constraint at the nominal data can fail after a perturbation.…

3 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·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 ResearchProbability·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
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Multimarket Cournot Equilibria with Heterogeneous Resource-Constrained Firms: The Unique Equilibrium in Closed Form via Augmented and Cutoff BudgetsResearch Paper

Cournot competition is the standard model of firms that compete by choosing quantities: each firm picks an output, the total output sets the market price, and an equilibrium is a profile in which no firm can gain by changing its own output alone. In practice firms rarely compete in one market. A manufacturer allocates a limited production capacity across…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research·Captain: mikedeng1

On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems: The Primal Shadows Converge Weakly, and in Value, to a Solution of the Normal ProblemResearch Paper

The Douglas–Rachford algorithm is one of the most widely used splitting methods for minimizing a sum f+gf + gf+g of two convex functions, or more generally for finding a zero of a sum A+BA + BA+B of two maximally monotone operators. It touches each summand only through its proximal mapping (resolvent), which is why it underlies ADMM and a large share of first-order…

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

Utility Tokens, Network Effects, and Pricing Power: An ICO Beats Traditional Sales Exactly When Network Intensity Exceeds a Threshold That Falls with Entrepreneurial AbilityResearch Paper

Between 2017 and 2019 thousands of start-ups sold utility tokens in initial coin offerings (ICOs): digital vouchers that grant access to a product that does not yet exist, sold before launch and often enforced by a smart contract. The financial literature mostly treats ICOs as a way to raise capital. Shakhnov and Zaccaria (SSRN 3613261; published in Manageme…

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

Pipeline Interventions: The Budget-Splitting Dynamic Program over an ε-Net of the Simplex Attains Social Welfare at Least OPT − 3(k−1)ε‖R‖∞Research Paper

Many consequential outcomes (a faculty position, a high-paying job) are the end of a long pipeline of earlier stages: neighbourhood, elementary school, high school, college, graduate school. Inequities that compound along such a pipeline are hard to correct by intervening only at its last stage, and a planner with a limited budget would like to decide where…

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

Value-Based Clinical Trials: Selecting Recruitment Rates and Trial Lengths in Different Regulatory Contexts: The Optimal Sample Size Grows as the Square Root of the Post-Adoption PopulationResearch Paper

Classical sample-size calculations for a clinical trial fix a significance level and a power and solve for the number of patients. They do not ask what the trial is for. A value-based design asks instead: given what it costs to recruit patients and what a better adoption decision is worth to the patients treated after the trial, how long should the trial…

13 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Interior Point Algorithms IV: Interior Iterates Identify the Strict Complementarity PartitionTextbook

Interior-point methods for linear programming generate a sequence of strictly positive primal-dual points that converges to the optimal set but never reaches it. The simplex method, by contrast, stops at an exact optimal vertex. Practical solvers and sensitivity analysis both need an exact answer: which variables are positive at optimality, and what the…

10 thms4 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research·Captain: Shuze Chen

Interior Point Algorithms I: The Central Path Converges to the Analytic Centers of the Optimal FacesTextbook

Primal–dual interior-point methods are the standard polynomial-time algorithms for linear programming. They do not walk along the vertices of the feasible polyhedron as the simplex method does. They follow a smooth curve through its interior, the central path, toward the optimal set. Every complexity bound for these methods is a statement about iterates…

7 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability+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
Convex OptimizationDiscrete GeometryOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization IX: Ellipsoids Containing a Sum of Ellipsoids Within a Factor (π/2)^{n/2}Textbook

Ellipsoids are the simplest convex bodies that can approximate an arbitrary convex set to within a factor depending only on the dimension. They are used for exactly that in control (reachable sets of linear systems), robust optimization (uncertainty sets) and the ellipsoid method. A linear system x(t+1)=Ax(t)+Bu(t)x(t+1)=Ax(t)+Bu(t)x(t+1)=Ax(t)+Bu(t) with ∥u(t)∥2≤1\|u(t)\|_2\le1∥u(t)∥2​≤1 illustrates the need.…

18 thms4 active usersReviewed
🏆Completed
CombinatoricsConvex OptimizationGraph Theory+1·Captain: Shuze Chen

Lectures on Modern Convex Optimization VI: Nesterov's π/2 Theorem for Semidefinite RelaxationsTextbook

Many combinatorial and nonconvex problems can be written as the maximization or minimization of a quadratic form under quadratic constraints. Such problems are NP-hard in general, but each has a semidefinite relaxation: a convex problem over positive semidefinite matrices, solvable to any accuracy in polynomial time, whose optimal value bounds the original…

19 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·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
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Cross-licensing in a Supply Chain with Asymmetric Manufacturers II: Every Innovation Equilibrium Is a Downstream Duopoly, Boundary or InteriorResearch Paper

In industries built on a key component sold by one dominant supplier, such as smartphone chipsets, the supplier's contract terms shape how much its downstream customers innovate. Some suppliers require their customers to cross-license their own patents to each other as a condition of buying the component, so that each manufacturer's innovation also improves…

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

A Theory of Liquidity in Private Equity II: With a Secondary Market, Liquid LPs Stay Out of the Primary Market Below a Threshold and Their Capital Share Pins Down the Discount to NAVResearch Paper

Private equity funds ask investors to commit capital before the timing of their own cash needs is known. If an investor needs liquidity before the fund pays out, selling a partnership claim can be more useful than holding it to maturity. The price at which such claims trade therefore affects both the return investors demand when a fund is raised and the way…

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

Quantum Economic Advantage: A Quantum Computing Firm Can Out-Invest a Cheaper-to-Scale Classical Rival in Subgame-Perfect EquilibriumResearch Paper

Quantum algorithms can reduce the work needed for some computations, but a provider also has to build hardware capable of serving a market. Bova, Goldfarb, and Melko model these two costs separately in Quantum Economic Advantage. Their question is whether a quantum provider can choose more market-creating investment than a classical rival even when building…

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

Competition and Collaboration on Fundraising for Short-Term Disaster Response: The Impact on Earmarking and Performance I: Existence and KKT Characterization of the Competition EquilibriumResearch Paper

In the days after a sudden-onset disaster, several humanitarian organizations (HOs) appeal to the same pool of donors. Donors increasingly want to earmark their gifts (restrict them to a programme, region or item), and HOs can offer more or less of that control. Earmarked money is less useful in the response: renegotiating restrictions costs time and…

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

Tokenomics: When Tokens Beat Equity I: Debt Financing Has a Unique Break-Even Repayment Between the Set-Up Cost and the Maximal Monopoly Profit, and the Entrepreneur Earns the Venture's NPVResearch Paper

Since 2017, billions of dollars have been raised through the issuance of crypto-assets, many of them tokens: digital claims on a future product or service, issued before the product exists. Malinova and Park, Tokenomics: When Tokens Beat Equity (SSRN 3286825; Management Science, 2023, doi:10.1287/mnsc.2023.4882), ask when such a pre-sale is a better way to…

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

Personalized Pricing and Distribution Strategies II: With Personalized Pricing by the Manufacturer, Dual Distribution Is Optimal Iff β > β_PZ(α), and β_PU(α) > β_PP(α)Research Paper

A manufacturer can sell directly to consumers and also supply an independent retailer. The retailer reaches consumers for whom its distribution service is more valuable, but its presence can also force the manufacturer to lower direct-channel prices. Jullien, Reisinger and Rey study when the additional sales justify dual distribution under different…

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

Social Media and News: Content Bundling and News Quality II: Negotiated Content Bundling Raises News Quality over the Benchmark iff c > β/Λ and over Unilateral Bundling iff c > c†Research Paper

Social platforms show news articles to their users without sending them to the publisher's site. Publishers argue that this diverts readers and advertising revenue, and so weakens their incentive to invest in journalism. Several regulators have responded by requiring dominant platforms to negotiate payments with news publishers: France transposed the EU…

14 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand II: A Route Whose Reduced Cost Exceeds ub − φ(RF1) Is in No Optimal Solution of the Routing Subproblem SF1Research Paper

Grocery chains and restaurants that promise delivery within an hour or less must decide, at each dispatch epoch, which drivers to send out and along which routes. Liu and Luo (arXiv:2107.13058v3; Manufacturing & Service Operations Management, 2023) model this as a finite-horizon dynamic program and solve its per-period approximation with a logic-based…

7 thms4 active usersReviewed
PreviousPage 8 of 70Next

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