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
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Multi-Product Dynamic Pricing with Reference Effects Under Logit Demand 2: The Myopic Policy Loses at Most β(1−α)ωp_H/((1−αβ)(1−β)) Against the Optimal Discounted RevenueResearch Paper

Consumers judge a price against a reference price, an internal benchmark formed from the prices they have seen before. A price below the reference is perceived as a gain and raises demand; a price above it is perceived as a loss and lowers demand. Because today's price moves tomorrow's reference price, a seller who maximises the revenue of each period…

6 thms2 active usersReviewed
🏆Completed
Control TheoryEconomicsOperations Research·Captain: mikedeng1

Influencer Authenticity: To Grow or to Monetize 1: The Optimal Endorsement Policy Is Authentic Until a Threshold Awareness, Then Permanently InauthenticResearch Paper

Social media influencers earn money by endorsing products to their followers. An influencer who endorses only products that fit her organic content keeps her audience; one who accepts every sponsorship offer earns more per follower today but loses part of her audience and grows more slowly. Practitioners describe this as the choice between growing and…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal Transport·Captain: mikedeng1

Robustifying Conditional Portfolio Decisions via Optimal Transport 2: With a Singleton Fiber and Fiber Mass at Least ε > 0, the Worst-Case Conditional Expected Loss Equals a Two-Multiplier DualResearch Paper

A portfolio manager who observes today's value x0x_0x0​ of a covariate (a market signal, a macroeconomic indicator) wants to choose a portfolio that performs well conditionally on that observation: the relevant risk is E[ℓ(Y,α,β)∣X=x0]\mathbb E[\ell(Y,\alpha,\beta)\mid X=x_0]E[ℓ(Y,α,β)∣X=x0​] of the asset return YYY, not its unconditional mean. With finitely many historical pairs …

9 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Quantile Optimization via Multiple Timescale Local Search for Black-box Functions: SPQO's Mean Absolute Error Decays as O(α_k/γ_k) + O(c_k²) + O(β_k^{1/2}/c_k) for Strongly Convex QuantilesResearch Paper

Risk-sensitive decisions are often judged by a quantile of an outcome rather than by its mean: the 95th percentile of waiting time in a service system, the value-at-risk of a portfolio, the tail of a project's completion time. When the outcome is produced by a stochastic simulation or another black box, its distribution is unknown and only samples are…

10 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

Managing Resources for Shared Micromobility: Approximate Optimality in Large-Scale Systems: The Transient-Horizon Mean-Field Policy Has Optimality Gap at Most γCγᵀ/(1 − γ)Research Paper

Shared bike and scooter systems (micromobility) must decide, every period, how to move vehicles between stations, which depleted vehicles to recharge, and how many vehicles to source from or return to a central warehouse. Customer trips redistribute the fleet in the meantime, and some vehicles come back with a depleted battery. For a realistic network, the…

10 thms2 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research+1·Captain: mikedeng1

Selling Data to Marketers 3: Under the Rotation Order, Marketing Lists Serve Low-Cost Marketers Efficiently and Over- (Under-) Supply High-Cost Ones Below (Above) the Rotation PointResearch Paper

Data brokers sell two kinds of products to marketers. A marketing list supplies the contacts a marketer needs in order to act at all; a data append enriches a list the marketer already holds. In both cases the broker can also choose how informative its accompanying analytics are, and it can price a menu of plans of different informativeness to marketers…

10 thms2 active usersReviewed
Functional AnalysisOperations ResearchPartial Differential Equations+1·Captain: mikedeng1

Optimality Conditions in Control Problems with Random State Constraints in Probabilistic or Almost Sure Form III: Absolutely Continuous and Singular Multipliers for Almost Sure State ConstraintsResearch Paper

Optimal control of partial differential equations under uncertainty asks for a single deterministic control uuu that performs well when the data of the PDE are random. When a constraint on the state must hold, the modeller has to decide how strictly: with high probability (a probabilistic constraint), for almost every realization (an almost-sure constraint),…

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

The Value of Information Design in Supply Chain Management IV: With Disjoint Supports, Full Disclosure Is Optimal When 2(b₀ − a₀) ≥ b₁ − a₁, Else No Disclosure at p₀ ≥ p̃ and Partial BelowResearch Paper

A retailer usually knows more about her future demand than the supplier who has to produce for her. If the supplier must commit to a production quantity before the order arrives, the retailer bears the cost of every unit he fails to produce. She cannot pay him or contract on quantities, but she can decide how much of her demand information to share, and she…

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

The Value of Information Design in Supply Chain Management II: Under Partial Disclosure the Value of Information Is Unimodal in p₀ and Falling in ξ Against No Disclosure, the Reverse Against FullResearch Paper

A retailer often knows more about her own demand than the supplier who produces for her. When the supplier must commit to a production quantity before demand is realized, what the retailer tells him shapes how much he produces, and therefore how much demand she can serve. Information design (Bayesian persuasion, Kamenica and Gentzkow, 2011) asks how a…

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

The Value of Information Design in Supply Chain Management I: With Nested Uniform Demand Supports, Full, No or Two-Message Partial Disclosure Is Optimal According to Critical-Ratio ThresholdsResearch Paper

A retailer who sees her own demand before her supplier does can decide how much of that knowledge to pass upstream. Sharing everything is not obviously best: the supplier uses the information to set his production quantity for his own benefit, and the retailer bears a cost when he under-produces. Candogan and Gurkan (SSRN 4378997; published in Management…

8 thms2 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research+1·Captain: mikedeng1

Selling Data to Marketers 4: Under the Rotation Order, Data Appends with Costs Below the Prior Mean Serve High-Cost Marketers Efficiently and Under- (Over-) Supply Low-Cost Ones Below (Above) v⁺Research Paper

Data brokers sell consumer data to firms that use it to decide whom to target, whom to lend to, or where to open a store. Two kinds of products are common: a marketing list, which supplies contact information without which the buyer cannot act at all, and a data append, which enriches information about consumers the buyer can already reach (Federal Trade…

9 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Robust Markov Decision Processes: Beyond Rectangularity 2: With Polyhedral r-Rectangular Factor Sets, One Deterministic Policy and Factor Matrix Stay Robust-Optimal for All Discount Factors Near 1Research Paper

A Markov decision process (MDP) models sequential decisions under uncertainty: in each state a decision maker picks an action, collects a reward, and the system moves to a random next state according to a transition kernel. In applications the kernel is estimated from data, and an optimal policy for the estimated kernel can perform poorly under a slightly…

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

On the Optimality of Affine Policies for Budgeted Uncertainty Sets 3: With a Network Recourse Matrix, the Optimal Affine Policy Costs m/2 − 1 While the Adjustable Optimum Is 0Research Paper

A two-stage adjustable robust linear program chooses a first-stage decision xxx before an uncertain right-hand side hhh is revealed, and a second-stage (recourse) decision y(h)y(h)y(h) afterwards, minimising the worst case over an uncertainty set U\mathcal UU of the total cost. Computing the optimal value zAR(U)z_{AR}(\mathcal U)zAR​(U) is hard in general (Feige et al., 2007), and…

8 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

Quantum algorithms for optimizers 3: Correctness of the digits computed by iterative phase estimation (corrected)Textbook

This mission develops Chapter 3 of Quantum algorithms for optimizers by Giacomo Nannicini. The chapter's selected results describe the mathematical guarantees below.

3 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

Quantum algorithms for optimizers 6: Unitary conjugation commutes with the matrix exponential: e^{iUHU†t} = U e^{iHt} U†Textbook

This mission develops Chapter 6 of Quantum algorithms for optimizers by Giacomo Nannicini. The chapter's selected results describe the mathematical guarantees below.

3 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

Quantum algorithms for optimizers 2: Simon's algorithm: n+t uniform samples orthogonal to a contain n−1 independent vectors with probability ≥ 1 − 2^{−(t+1)}Textbook

This mission develops Chapter 2 of Quantum algorithms for optimizers by Giacomo Nannicini. The chapter's selected results describe the mathematical guarantees below.

1 thm2 active usersReviewed
Quantum Information·Captain: Goku

Quantum algorithms for optimizers 8: End-to-end complexity of the quantum MaxCut SDP solver in the QRAM model (corrected statement)Textbook

This mission develops Chapter 8 of Quantum algorithms for optimizers by Giacomo Nannicini. The chapter's selected results describe the mathematical guarantees below.

14 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Robust Markov Decision Processes: Beyond Rectangularity 1: Under r-Rectangular Factor Uncertainty, Robust Value Iteration Converges to the Optimal Worst-Case Value, Attained by a Deterministic PolicyResearch Paper

A Markov decision process (MDP) is optimized for a transition kernel that, in practice, is estimated from data, and the optimal policy for the estimated kernel can perform poorly under small perturbations of it. The robust MDP approach replaces the single kernel by an uncertainty set of kernels and asks for the policy with the best worst-case expected…

12 thms2 active usersReviewed
🏆Completed
Probability·Captain: LG

Secretary Problem: the 37% RuleTextbook

The secretary problem is the standard example of an optimal stopping problem with partial information. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game and the best choice problem. It is studied in applied probability, statistics and decision theory. Its solution is often called the 37% rule: a…

10 thms2 active usersReviewed
Convex OptimizationDynamic ProgrammingOperations Research+1·Captain: mikedeng1

Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs 1: Almost Sure Convergence of the Risk-Averse Sampling-Based Decomposition AlgorithmResearch Paper

Multistage stochastic programs model sequential decisions under uncertainty: hydro-thermal scheduling, portfolio management and capacity planning are standard examples. Their dynamic programming equations involve recourse functions (cost-to-go functions) of the decision history, which cannot be computed exactly. Stochastic Dual Dynamic Programming (SDDP),…

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

Stochastic Dual Dynamic Integer Programming 1: With Valid, Tight and Finite Cuts, Stochastic Nested Decomposition Finds an Optimal Solution in Finitely Many Iterations with Probability OneResearch Paper

Multistage stochastic programs model decisions taken over time while uncertain data are revealed: generation scheduling in hydro-thermal power systems, capacity expansion, unit commitment, portfolio management. When the uncertainty is represented by a finite scenario tree, the problem becomes one very large deterministic program, and decomposition…

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

Stochastic Dual Dynamic Integer Programming 2: Lagrangian Cuts from the Local-Copy Reformulation Are Valid and Tight at Binary StatesResearch Paper

Multistage stochastic integer programs model sequential decisions under uncertainty in which some decisions are discrete: unit commitment in power systems, capacity expansion, production planning with setups. Their linear (continuous) counterparts are routinely solved by nested decomposition methods such as stochastic dual dynamic programming (SDDP; Pereira…

8 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization IV: CAKKT-Regularity Implies Abadie's Constraint QualificationResearch Paper

Algorithms for smooth nonlinear programming, such as augmented Lagrangian, interior point and sequential quadratic programming methods, do not stop at exact Karush–Kuhn–Tucker (KKT) points. They stop at points where the KKT conditions hold approximately. Sequential optimality conditions make this precise: they are properties of sequences xk→x∗x^k\to x^*xk→x∗ with…

13 thms2 active usersReviewed
Control TheoryConvex OptimizationLinear algebra·Captain: mikedeng1

Quadratic Matrix Inequalities with Applications to Data-Based Control V: A Reduced LMI in P Alone and an Explicit Data-Based Stabilizing GainResearch Paper

Data-driven control asks for a controller computed directly from measured trajectories of an unknown system, without first identifying a model. When the measurements are corrupted by noise, many systems explain the same data, and a controller is acceptable only if it works for all of them. Van Waarde, Camlibel, Eising and Trentelman (arXiv:2203.12959) model…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationGraph Theory·Captain: mikedeng1

Shortest Paths in Graphs of Convex Sets I: The Perspective Mixed-Integer Convex Program (5.5) Has the Same Optimal Value as the Shortest-Path Problem in a Graph of Convex SetsResearch Paper

Many planning problems combine a discrete choice with a continuous one. A robot moving through a cluttered room chooses which free regions to traverse and where exactly to cross between them; a vehicle chooses a sequence of operating modes and a trajectory within each mode. Marcucci, Umenberger, Parrilo and Tedrake (arXiv:2101.11565, SIAM J. Optim. 2024, doi…

11 thms2 active usersReviewed
PreviousPage 69 of 93Next

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