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

Competition Between Two-Sided Platforms Under Demand and Supply Congestion Effects: Surge Pricing Lowers Customer and Raises Driver Utility, and Near the Base Market Size Beats Fixed Prices for BothResearch Paper

Ride-hailing platforms such as Uber and Lyft raise prices when demand spikes, a practice known as surge pricing. The practice is controversial: customers see higher fares, and it is not obvious that anyone but the platform gains. Bernstein, DeCroix and Keskin (MSOM 2020; author version SSRN 3250224) study two competing platforms whose customers dislike…

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

Sparse Solutions of a Class of Constrained Optimization Problems: For All Small p > 0, Every Lp Minimizer under an L1 Constraint Is a Sparsest Solution, and the Solution Set StabilizesResearch Paper

Many problems in signal processing, statistics and compressed sensing ask for a sparse solution of an underdetermined, possibly noisy linear system: a vector x∈Rnx\in\mathbb R^nx∈Rn with as few nonzero entries as possible such that AxAxAx is close to bbb. The direct formulation, minimizing the number of nonzeros ∥x∥0\|x\|_0∥x∥0​, is combinatorial and NP-hard in general. A…

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

Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems: The Maximum Support Algorithm Is Correct and Terminates Within Condition-Measure BoundsResearch Paper

Finding a nonzero nonnegative point in a linear subspace is the feasibility core of linear optimization. For a subspace L⊆RnL \subseteq \mathbb R^nL⊆Rn with orthogonal complement L⊥L^\perpL⊥, the pair of problems

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

Value Loss in Allocation Systems with Provider Guarantees: Under Pareto-Efficient Provider Guarantees the Relative Value Loss Is at Most max{δ, (n−1)/(n+(1−δ)(n−1))}Research Paper

Centralized platforms that assign work to independent service providers, such as ride-hailing and freelance marketplaces, sales organisations distributing leads, and firms sourcing from several suppliers, are often asked to give their providers guarantees: a minimum income, a max-min fair share of the work, or another fairness criterion. A guarantee shrinks…

11 thms2 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchStatistics·Captain: mikedeng1

Optimal Experimental Design for Staggered Rollouts: S-Shaped, Covariate-Balanced Rollouts Maximize the Trace of the GLS Precision of Instantaneous and Lagged EffectsResearch Paper

Firms and public agencies often roll a new product, feature or policy out gradually: a few markets first, more later, every market eventually. When the rollout is itself an experiment, its schedule determines how precisely the effect of the treatment can be estimated. A staggered rollout is the common design in which treatment, once switched on in a unit,…

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

Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure: Mirror Backpressure Loses at Most O(K/T + 1/K + √(ηK)) Payoff per CustomerResearch Paper

Ride-hailing, car-sharing and bike-sharing platforms, as well as scrip systems, move a fixed stock of reusable resources around a network. Each customer that is served relocates one unit, from a pick-up location to a drop-off location. The operator decides, customer by customer, whether to serve and with which unit. Supply can run dry at a location, which…

15 thms2 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

When Is Assortment Optimization Optimal?: Under History-Monotone Futures, Assortments Are Optimal Among All IC MechanismsResearch Paper

Assortment optimization is the problem of choosing which items to offer a customer who buys at most one item, when each item has a fixed, exogenous price. It is one of the central problems of revenue management: the customer's behaviour is described by a choice model, and a large literature computes optimal assortments under specific models, from the…

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

Exact Penalization of Generalized Nash Equilibrium Problems: Under a Slater-Type Condition, Every Equilibrium of the ℓq-Penalized Nash Game Solves the Generalized Game for All Large PenaltiesResearch Paper

In a generalized Nash equilibrium problem (GNEP) each player's feasible set depends on the strategies of the other players. Such coupled constraints arise wherever players share a resource: transmission capacity in electricity and telecommunication markets, emission caps in environmental games, track time in railway pricing, road capacity in transportation…

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

Projectively Self-Concordant Barriers: Projective Self-Concordance with γ = (ν − 2)/√(ν − 1) Is Equivalent to Self-Concordance of the Logarithmically Homogeneous Extension ν(−log t + f(x/t))Research Paper

Interior-point methods for convex programming, introduced in their modern form by Nesterov and Nemirovski, run Newton's method on a barrier function of the feasible set. Their complexity analysis rests on a single analytic property of the barrier, self-concordance: the third derivative is controlled by the second, ∣F′′′(x)[h,h,h]∣≤2 (F′′(x)[h,h])3/2|F'''(x)[h,h,h]|\le 2\,(F''(x)[h,h])^{3/2}∣F′′′(x)[h,h,h]∣≤2(F′′(x)[h,h])3/2.…

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

If It Is Surely Better, Do It More? Implications for Preferences Under Ambiguity: Ambiguity Aversion Toward an Event Breaks Monotonicity in Optimal Mixtures for c-Linearly Biseparable PreferencesResearch Paper

Many economic and managerial decisions are choices of a mixing weight: how much effort to put on one sale rather than another, how much wealth to put in a risky asset, how to split a portfolio between two contracts. A natural comparative-statics requirement is that if one of the two options is improved in every state of the world, the decision maker should…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOperations Research·Captain: mikedeng1

A Single-Loop Algorithm for Decentralized Bilevel Optimization: O(1/K) Stationarity and Consensus Rates of SLDBO without Heterogeneity AssumptionsResearch Paper

Bilevel optimization chooses an upper-level variable xxx to minimize an objective that depends on the solution y∗(x)y^*(x)y∗(x) of a lower-level problem. Hyperparameter tuning and meta-learning are the standard examples (Franceschi et al. 2018; Ghadimi and Wang 2018). In the decentralized version the data are split among nnn agents. Each agent sees only its own upper-…

17 thms2 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Graphical Convergence of Subgradients in Nonconvex Optimization and Learning: Uniform Concentration of Empirical Bregman Proximal Points for Weakly Convex RisksResearch Paper

A learner who minimizes a regularized population risk

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

What Is the Impact of Nonrandomness on Random Choice Models?: Revenue-Ordered Assortments Are Optimal When One Product's Utility Is DeterministicResearch Paper

Retailers choose which products to show a customer, and the customer chooses at most one of them. The assortment problem asks for the offer set that maximizes expected revenue, given a model of how customers choose. Under the multinomial logit (MNL) model every alternative, the no-purchase option included, carries an independent Gumbel noise term of the…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

On Policies for Single-Leg Revenue Management with Limited Demand Information: the Valuation Tracking Pricing Policy Is c*(P)-CompetitiveResearch Paper

Single-leg revenue management asks how a seller holding kkk units of a perishable item (seats on one flight leg, rooms for one night) should price or ration them to customers who arrive one at a time. The classical theory assumes a demand forecast. When no forecast is available, a standard robust criterion is competitiveness: an online policy is ccc-competitive…

9 thms2 active usersReviewed
🏆Completed
Calculus of VariationsMachine LearningProbability·Captain: mikedeng1

Game on Random Environment, Mean-Field Langevin System, and Neural Networks: First-Order Condition for Entropy-Regularized Minimization over Probability Measures with a Fixed MarginalResearch Paper

Several problems in machine learning and game theory are optimization problems over probability measures. Training a wide two-layer neural network can be viewed as minimizing a functional F(ν)F(\nu)F(ν) of the distribution ν\nuν of the network's parameters (Mei, Montanari, Nguyen, PNAS 2018; Hu, Ren, Šiška, Szpruch, arXiv:1905.07769). Adding a relative-entropy…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems: Optimal Values and Solutions of the Moreau-Regularized Problems Converge to Those of the Original ProblemResearch Paper

A chance constraint asks that a random inequality system hold with at least a prescribed probability ppp. Such constraints appear throughout engineering and energy optimization: reservoir and power-system management, network design, and any decision that must stay feasible against uncertain demand or inflow with high reliability. The function …

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

Price Optimization Under the Finite-Mixture Logit Model: Branch-and-Bound over No-Purchase Probabilities Terminates with a (1 − ε)-Optimal Price VectorResearch Paper

A seller who offers nnn products and sets one price vector for all customers must price for a heterogeneous population. The finite-mixture logit (FML) model describes such a population with a small number of segments. Each segment follows its own multinomial logit (MNL) demand, so this is the simplest heterogeneous extension of the MNL model. It is widely…

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

A Simple Rule for Pricing with Limited Knowledge of Demand: for every concave inverse demand the linear price (P_m + c)/2 earns at least half the optimal profitResearch Paper

A firm launching a new product (a drug, a software package, a digital download) must choose a price before it has data on its demand curve. Classical monopoly pricing needs the whole demand curve: the optimal price balances marginal revenue against marginal cost, and both depend on the curve's shape. Cohen, Perakis and Pindyck (Management Science; accepted…

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

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online: GenSm-Main Is a Universally Truthful, Individually Rational, Budget-Feasible 505-Approximation MechanismResearch Paper

A buyer with a fixed budget wants to hire a team from a pool of sellers, each of whom knows privately what participating would cost them. The buyer values teams through a set function and pays each hired seller. The sellers are strategic: they report whatever cost serves them best. A budget-feasible mechanism decides whom to hire and what to pay so that…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming: With α = √T and σ = 1/√T, Expected Constraint Violation and Objective Regret Are O(√T)Research Paper

Many decision problems in operations research and machine learning ask to minimize an expected cost subject to constraints that also hold only in expectation: a portfolio with a bound on expected shortfall, a resource allocation whose expected load must stay below capacity, a classifier with an expected fairness constraint. The expectations are integrals…

13 thms2 active usersReviewed
🏆Completed
AnalysisDynamical Systems·Captain: mikedeng1

Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions: A Bounded Subgradient Sequence That Does Not Converge for a Whitney-Stratifiable KŁ FunctionResearch Paper

The small-step subgradient method is the basic algorithm for minimizing a nonsmooth, nonconvex, locally Lipschitz function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R. It is also the scheme behind stochastic gradient training of neural networks with nonsmooth activations. From a starting point x0x_0x0​ it iterates

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

Technical Note—Optimal Procurement in Remanufacturing Systems with Uncertain Used-Item Condition: Optimality of State-Dependent Noncongestive-Acquisition PoliciesResearch Paper

Remanufacturing restores used products (cores) to a sellable condition. Its economics depend on which cores are acquired: a core's condition is unknown until it has been collected, disassembled and inspected, and condition determines what remanufacturing costs. A remanufacturer who decides when to acquire cores therefore commits money before learning what…

7 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

Semidefinite Approximations for Bicliques and Bi-Independent Pairs: For Every Bipartite Graph, h(G) ≤ ½√g(G) ≤ h₁(G) ≤ ½√g₁(G) ≤ ¼α(G)Research Paper

A biclique in a graph is a pair of disjoint vertex sets (A,B)(A,B)(A,B) in which every vertex of AAA is adjacent to every vertex of BBB. Maximum-edge bicliques model problems in product manufacturing lines and formal concept analysis; balanced bicliques arise in VLSI design and in the analysis of biological data; and the maximum product ∣A∣⋅∣B∣|A|\cdot|B|∣A∣⋅∣B∣ over…

11 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: Shuze Chen

Scheduling Parallel Machines On-Line: Removing advance knowledge of release datesResearch Paper

A scheduler in a computing system may know how to allocate a fixed collection of jobs efficiently while having no reliable forecast of future arrivals. A guarantee for jobs available at the outset does not immediately answer whether decisions remain effective when new work appears during execution. Unknown release dates capture this distinction: a job…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: Shuze Chen

Modeling, Measuring and Managing Risk XII: The Value-of-Information Process Is a SupermartingaleTextbook

Multi-stage stochastic optimization models a decision maker who acts at times 0,1,…,T−10,1,\dots,T-10,1,…,T−1 while a random scenario unfolds, and who may use at each time only the information revealed so far. This nonanticipativity constraint is what separates a genuine multi-stage problem from a collection of deterministic ones. A standard way of measuring its cost, the…

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