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

Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing II: With Store-Wise Homogeneous Discounts, Some Optimal Sequential Assortments Are Nested and Revenue-OrderedResearch Paper

A retailer that operates several physical stores can show a customer who finds nothing she likes in her store the products that other stores carry, for example on an in-store screen or a magic mirror, and ship the chosen product from the other store. The customer then buys at a utility discount: shipping takes time and the product cannot be tried on. Liu,…

17 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Consumer Privacy in Online Retail Supply Chains I: For a Single Firm the GDPR Raises Profit and Social Welfare, and Raises Consumer Surplus Exactly When v < 2M√(1−δ)/(Z√F)Research Paper

The European Union's General Data Protection Regulation (GDPR, in force since 2018) shifted control over personal data from firms to consumers: data may be collected and processed only with the consumer's consent, and consent may be given for some uses and withheld for others. Online retailers use consumer data in two opposite ways. Saved shopping carts,…

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Multi-Product Dynamic Pricing with Reference Effects Under Logit Demand 1: Without Gain-Seeking Products the Myopic Price Path Converges to a Steady State; with One the Myopic Policy Has NoneResearch Paper

Consumers judge a price against a reference price, an internal benchmark formed from the prices they have seen before. A price above the reference is perceived as a loss and depresses demand; a price below it is perceived as a gain and stimulates it. Because today's prices shape tomorrow's reference prices, a seller facing reference effects solves a dynamic…

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

Telehealth in Acute Care: Pay Parity and Patient Access: Under Pay Parity, for Duplicate-Visit Probability q in (q†, q*), Telehealth Maximizes Provider Revenue but Office-Only Maximizes AccessResearch Paper

During the COVID-19 pandemic most U.S. payers began reimbursing a telehealth consultation at the same rate as the corresponding office visit, a policy called pay parity. Many states have since made it permanent, on the stated ground that it improves patients' access to care. In acute care (primary and urgent care) a telehealth visit sometimes cannot resolve…

12 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Capturing the Benefits of Autonomous Vehicles in Ride-Hailing: The Role of Market Configuration 2: On Independent Platforms, AV-HV Coexistence Raises the Price When Labor Is Elastic EnoughResearch Paper

Ride-hailing platforms are expected to add autonomous vehicles (AVs) to fleets of human-driven vehicles (HVs). A common expectation is that AVs, by removing the driver's wage, will make rides cheaper. Lian and van Ryzin (SSRN 3716491; published in Management Science, 2025, DOI 10.1287/mnsc.2020.03112) show that the answer depends on the market configuration.…

10 thms3 active users
🏆Completed
Operations ResearchOptimal Transport·Captain: mikedeng1

Robustifying Conditional Portfolio Decisions via Optimal Transport 1: With a Singleton Fiber and Only Positive Fiber Mass Required, the Worst-Case Conditional Expected Loss Collapses to sup_y ℓ(y)Research Paper

A portfolio manager who observes side information (a covariate XXX, such as a market indicator) before choosing a portfolio wants to control the loss of the asset returns YYY conditional on the observed covariate value x0x_0x0​. The conditional law of YYY given X=x0X=x_0X=x0​ is unknown and must be learned from NNN historical pairs (x^i,y^i)(\widehat x_i,\widehat y_i)(xi​,y​i​). When x0x_0x0​ itself…

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

Capturing the Benefits of Autonomous Vehicles in Ride-Hailing: The Role of Market Configuration 3: A Monopoly AV Supplier on a Common Platform Chooses a Newsvendor-Fractile CapacityResearch Paper

Ride-hailing platforms are expected to add autonomous vehicles (AVs) to fleets that today consist of human drivers. AVs have a cost advantage: a human driver must earn a reservation wage for every hour on the platform, while an AV owner pays a fixed capital cost per calendar hour and a smaller variable cost per operating hour. Whether that advantage reaches…

9 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing I: Under Simultaneous Recommendation, Offering the Single-Store Optimal Assortment in Every Store Is OptimalResearch Paper

Retail chains increasingly run their physical stores and online channels as one network. A customer who walks into a store and finds nothing she wants can be shown products stocked in other stores of the chain, to be shipped or picked up later. This raises a basic assortment question: when every store can point its customers to the rest of the network,…

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

Common Ownership, Competition, and Corporate Governance: Equilibrium Common Ownership Decreases in Managers' Ability to Divert Profits and Increases in the Cost of MonitoringResearch Paper

Large asset managers now hold significant stakes in many competing firms at once. When the same investor owns shares in rival firms, managers who weigh that investor's interests have an incentive to compete less hard, which raises industry profits at consumers' expense. This "softening of competition" effect is the subject of a large empirical and antitrust…

13 thms3 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research·Captain: mikedeng1

Selling Data to Marketers 2: In Selling Data Appends with Costs Below the Prior Mean, the High-Cost Plan Is Efficient and the Low-Cost Plan Carries Less Information If φ < 1/2 and More If φ > 1/2Research Paper

Data brokers sell information about consumers to firms that decide whom to target: a lender deciding whom to offer credit, a retailer deciding whom to mail. Two products dominate this market. A marketing list sells contact information together with an analysis, so that a firm cannot reach the consumer at all without buying. A data append adds information…

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

Third-Degree Price Discrimination in Two-Sided Markets: Seller-Side Discrimination Raises Platform Profit, Buyer and Low-Type Seller Surplus and Total Welfare; High-Type Sellers Gain iff b > b̂Research Paper

Third-degree price discrimination means charging different prices to identifiable groups of customers. Its welfare effects are a classical question in industrial organization. With linear demands and every market served under uniform pricing, discrimination leaves total output unchanged and lowers total welfare (Pigou 1920). More generally, welfare can rise…

12 thms3 active usersReviewed
🏆Completed
EconomicsMechanism DesignOperations Research·Captain: mikedeng1

Selling Data to Marketers 1: In Selling Marketing Lists, the Low-Cost Plan Is Efficient and the High-Cost Plan Carries More Information Than the Benchmark If φ < 1/2 and Less If φ > 1/2Research Paper

Data brokers such as Acxiom, Nielsen and Oracle, and data generators such as Google and Facebook, sell processed consumer data to firms that use it to decide whom to target, whom to lend to, or which market to enter. The U.S. Federal Trade Commission's 2014 report on data brokers distinguishes two products: a marketing list, which carries contact…

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

The Value of Information Design in Supply Chain Management III: With Overlapping Supports, the Optimal Policy Goes from Partial to No to Full Disclosure as the Critical Ratio RisesResearch Paper

A retailer often knows more about her own demand than the supplier who must produce for her. In a decentralized supply chain the supplier sets a production quantity before demand is realized, and an under-informed supplier produces too little or too much. The retailer can shape what the supplier believes by committing in advance to a disclosure policy, a…

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

Asset Pricing with Costly Short Sales 1: The Lending Agent Charges Half the Pessimist's Frictionless Sharpe Ratio, and Lending Is Active Exactly When Her Net Sharpe Ratio Is NegativeResearch Paper

To sell a stock short, an investor must first borrow it, and the owner who lends it charges a lending fee. Securities lending is a large market, and the fee varies across stocks: D'Avolio (2002) documents that shorting costs are positively related to the dispersion of investors' beliefs. Short-sale constraints have a long history in asset pricing (Miller…

6 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 2: With Zero Lead Time and Minimal Disposal, Two Myopic Solutions Bound the Optimal Order-Up-To LevelResearch Paper

Food, blood products, pharmaceuticals and many retail goods are perishable: a unit is usable for a fixed number of periods and is then discarded. A seller of such a product decides every period how much to order, what price to charge, and how much stock to deplete or dispose of. Because units of different ages coexist, the state of the system is a vector of…

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

The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment: Ψ-Pairwise Alignment Yields a Replenishment Policy Within Factor 1 + 5ϵ of Any PolicyResearch Paper

The joint replenishment problem is a basic model of coordinated inventory control. A firm stocks nnn commodities, each of which follows its own Economic Order Quantity (EOQ) model, but every order also incurs a joint ordering cost K0K_0K0​, regardless of which commodities it contains. Ordering commodities together therefore saves money, and the question is how to…

19 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingNumerical AnalysisOperations Research·Captain: mikedeng1

Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme: The Quasi-Variational Inequality with Inspection Operator Has a Unique Bounded SolutionResearch Paper

In many sequential decision problems the state of a system is not observed for free. A controller monitoring a machine, a patient or an inventory must pay to inspect it, and between inspections it acts on a belief rather than on the state. The observation cost model (OCM) makes this precise for a finite Markov chain: at each time the controller either pays…

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

A Model of Shoppertainment Live Streaming: Zero Entertainment Bandwidth Is Never Optimal, the Optimal Bandwidth Lies Beyond the Traffic Peak, and Is Full Entertainment When vₑ > v(1+q)/4Research Paper

In shoppertainment live streaming a single streamer sells products from many manufacturers during live sessions that mix product presentation with entertainment. Some of the most successful streamers spend much of their air time on content unrelated to the products; the paper cites Dong Yuhui, who devotes his sessions to English lessons. Traditional TV…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Coordinating Inventory Control and Pricing Strategies for Perishable Products 1: With Backlogging, the Profit-to-Go Is L♮-Concave and the Optimal Policy Is Monotone with Bounded SensitivityResearch Paper

Food, blood and pharmaceuticals are perishable: a unit not sold within its lifetime is thrown away. A seller decides each period how much to order, which price to charge, and whether to dispose of stock early. A large stock of old units argues for a lower price and a smaller order.

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming: Individual Chance Constraints over Markov Ambiguity Sets Are Finite Conic SystemsResearch Paper

Many engineering and operations problems must guarantee that a system operates safely with high probability, when the uncertain parameters z~\tilde zz~ are only partially known. A chance constraint asks that the safety condition Sz~≤tS\tilde z \le tSz~≤t hold with probability at least 1−ϵ1-\epsilon1−ϵ for a tolerance ϵ∈(0,1)\epsilon \in (0,1)ϵ∈(0,1). When the distribution of z~\tilde zz~ is…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs 2: Subdifferential of the Value Function of a Convex ProgramResearch Paper

Stochastic dual dynamic programming (SDDP) and related decomposition methods solve multistage stochastic programs by approximating each stage's recourse function from below by a maximum of affine cuts. Every cut needs a value and a slope: the value of a convex subproblem at a trial point, and a subgradient of that subproblem's optimal value as a function of…

11 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization III: SAKKT-Regularity Is the Weakest Strict Constraint Qualification for SAKKTResearch Paper

Algorithms for smooth constrained optimization stop when an approximate optimality test passes. The tests used in practice are sequential optimality conditions: properties of a sequence of iterates xk→x∗x^k\to x^*xk→x∗ rather than of the limit point alone. Every local minimizer satisfies them, with or without a constraint qualification. The price is that a point…

11 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization II: AGP-Regularity Is the Weakest Strict Constraint Qualification for AGPResearch Paper

Algorithms for smooth constrained optimization stop when an approximate optimality test passes. The tests used in practice are sequential optimality conditions: properties of a sequence of iterates xk→x∗x^k\to x^*xk→x∗ rather than of the limit alone. Every local minimizer satisfies them, with or without a constraint qualification, which makes them natural stopping…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamic ProgrammingOperations Research+1·Captain: mikedeng1

On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs 2: Under τ-Admissible Random Node Selection, Cuts Become Exact Almost Surely at Every Tree NodeResearch Paper

Stochastic dual dynamic programming (SDDP) and its relatives are the standard algorithms for multistage stochastic programs: hydro-thermal scheduling, energy storage and long-horizon capacity planning are solved with them in industry. They approximate each future cost function from below by a maximum of affine cuts, compute new cuts only at a few randomly…

16 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization I: MFCQ or a Full Active-Gradient Cone Is the Weakest Strict CQ for Scaled-AKKTResearch Paper

Practical algorithms for nonlinear programming do not stop at an exact Karush–Kuhn–Tucker (KKT) point; they stop when an approximate stationarity test passes. Sequential optimality conditions formalize what such tests certify: they are properties of a feasible point x∗x^*x∗ phrased through sequences xk→x∗x^k \to x^*xk→x∗ and multiplier estimates, and every local…

9 thms3 active usersReviewed
PreviousPage 25 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