A coordinated effort to formalize the mathematics of operations research in Lean 4.
Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.
Incentive-Compatible Forecasting Competitions: the Independent-Event Lotteries mechanism is strictly incentive compatible under belief independence and limit accurate for independent eventsResearch Paper
Forecasting competitions ask many forecasters to report probabilities for many future binary events and award a single prize to one of them. They are used to identify and reward accurate forecasters: the Good Judgment Project gave "superforecaster" status to the top 2% by quadratic score, and data-science platforms run similar leaderboards. The usual rule…
Driving Supply to Marketplaces: Optimal Platform Pricing When Suppliers Share Inventory: The Supplier Shares Its n-th Unit Exactly When the Time-to-Go Is at Most a Threshold tₙResearch Paper
Online marketplaces such as Zalando, Amazon or Farfetch let brands sell through the platform's storefront in addition to their own stores. One common arrangement is inventory sharing: the brand keeps ownership of its stock, but makes it visible to the platform's customers, and pays the platform a commission on every unit the platform sells. For a supplier…
Mixed-Integer Convex Representability: Closed Rational MICP-Representable Sets Whose Convex Subsets Have Bounded Diameter Are Finite Unions of Compact Convex and Closed Periodic SetsResearch Paper
Mixed-integer convex programming (MICP) optimizes over sets described by convex constraints together with the requirement that some variables be integers. Modern solvers handle such problems routinely, so a modeler who wants to optimize over a nonconvex set S⊆Rn asks a basic question first: can S be written as the projection of the…
Portfolio Optimization Based on Almost Second-Degree Stochastic Dominance: Approximate ASSD Under a Discretization Scheme Implies ASSDResearch Paper
Second-order stochastic dominance (SSD) is the standard ordering of risky prospects for risk-averse investors: a return X dominates a return Y by SSD when every investor with a nondecreasing concave utility weakly prefers X. Portfolio models that require a chosen portfolio to dominate a benchmark by SSD go back to Dentcheva and Ruszczyński (2003) and are…
Can a Supplier’s Yield Risk Be Truthfully Communicated via Cheap Talk?: Truthful Yield Reporting Is an Equilibrium Iff Expected Market Potentials Bracket the Adjusted Wholesale RateResearch Paper
A firm that outsources a new product or component to a supplier with an immature production process faces random yield: only a random fraction of the input becomes a usable unit. In semiconductor manufacturing, for instance, yield losses on new-generation chips have been reported at 30–45%. The supplier usually knows her own yield better than the buyer…
Cross-Category Retailing Management: Substitution and Complementarity: Optimal Cross-Selling Prices Equalize Aggregate Markups, and the Optimal Profit Is the Unique Fixed Point of HResearch Paper
Retailers often sell products from two categories that are bought one after the other: a television and then a speaker, a laptop and then a mouse, a suit and then a tie. The first purchase changes how much the second is worth to the consumer, which is called a complementarity effect, and online stores act on it by showing secondary products only after a…
Stochastic Optimization Forests: the approximate risk criterion consistently approximates the oracle splitting criterion as the region to split shrinksResearch Paper
In contextual stochastic optimization a decision z∈Rd is chosen after observing features X∈Rp, and the ideal policy solves, for each feature value,
“Sherlocking” and Platform Information Policy: The Full-Commitment Outcome Is Implementable by an Information Policy If and Only If the No-Entry Obedience Constraint (OC0) HoldsResearch Paper
Large online marketplaces are hybrid platforms: they host third-party sellers and also sell their own products. Running the marketplace gives the platform access to sellers' sales data, and it can use that data to identify successful products and launch imitations of its own. The practice is colloquially called "Sherlocking". It has drawn regulatory…
Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper
Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…
Tracking Truth with Liquid Democracy: Upward Delegation Satisfies Probabilistic Do No Harm and Positive GainResearch Paper
Liquid democracy lets each voter either vote directly or delegate the vote to another voter, who may delegate it further. It has been used in practice, for example by the German Pirate Party on the LiquidFeedback platform and in the Google Votes experiment, and has been studied in computational social choice as a way to give more weight to better-informed…
Surge Pricing and Its Spatial Supply Response: Within an Attraction Region, Supply Fills the Congestion Bound Outward from the Sink at Locally Optimal Prices Without Loss of RevenueResearch Paper
Ride-hailing platforms change prices by location in real time, and drivers respond by moving. A price increase at one location changes where drivers go, how congested each location becomes, and therefore what every driver earns everywhere else. Besbes, Castro and Lobel, Surge Pricing and its Spatial Supply Response (SSRN 3124571, version of May 17, 2019;…
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization: Lower Bounds on the Smallest Eigenvalue of Boltzmann Covariance Matrices over a Convex BodyResearch Paper
Interior point methods for convex optimization need a self-concordant barrier for the feasible set, and for many convex bodies, such as the subtour elimination polytope, membership can be decided in polynomial time while no efficiently computable barrier is known. The entropic barrier of Bubeck and Eldan (arXiv:1412.1587) is a self-concordant barrier…
Contextual Bandits with Cross-Learning: UCB1.CL Has Expected Regret O(Kκ̄ log T/Δ*) and O(√(κ̄KT log T)) with Stochastic Rewards and Adversarial ContextsResearch Paper
In a contextual bandit a learner plays T rounds; in round t it observes a context ct, pulls one of K arms and receives the reward of that arm in that context. In many applications the learner also learns what the pulled arm would have paid in other contexts. The motivating example of Balseiro, Golrezaei, Mahdian, Mirrokni and Schneider (arXiv:1809.09582)…
On Optimality Conditions for Nonlinear Conic Programming: Under the Generalized Łojasiewicz Inequality, Feasible Limit Points of the Augmented Lagrangian Method Satisfy CAKKTResearch Paper
Nonlinear conic programming covers nonlinear programming (NLP), nonlinear semidefinite programming (NLSDP) and nonlinear second-order cone programming (NSOCP) in one model: minimize a smooth objective subject to the requirement that a smooth map takes values in a closed convex cone. The classical first-order necessary condition, the Karush–Kuhn–Tucker (KKT)…
Robust Learning of Consumer Preferences: the Myopic Tracking Policy is worst-case asymptotically optimal for identifying the top-ranked productResearch Paper
A company that is about to launch a product often has several candidate versions of it (designs, packagings, feature bundles) and wants to know which one consumers like best. A common way to find out is to ask: show an arriving consumer a few versions and record which one they pick. Each such query costs time and money, and consumer answers are noisy, so…
The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition: The Minimax-Optimal Allocation Rule Is Constant Then Inversely Proportional to the Square Root of the Virtual CostResearch Paper
Data marketplaces buy personal data from many individuals to estimate population statistics. Two features set such pricing apart from an ordinary procurement auction. First, each data owner has a private cost of sharing, so the buyer must design a menu of payments that elicits these costs truthfully. Second, data are correlated across people: an individual…
Convex Optimization for Bundle Size Pricing Problem: the Cross-Moment-Model Profit Is Concave in Choice ProbabilitiesResearch Paper
In bundle size pricing (BSP) a seller of many products offers a menu of bundles in which the price of a bundle depends only on its size, the number of items in it. Customers choose which items to put in a bundle and which size to buy. Season tickets for theatres and sports teams, cable-TV channel packages and streaming plans priced by the number of…
Joint Product Framing (Display, Ranking, Pricing) and Order Fulfillment Under the Multinomial Logit Model for E-Commerce Retailers: Randomized Framing and Fulfillment Loses O(√θ) Against DET'Research Paper
An online retailer decides, for every arriving customer, how to frame its catalog: which products are displayed, in which section or position, and at which of several price points. Framing changes demand. A product on a promotional banner sells more than the same product further down the page. The retailer must also decide which fulfillment center (FC)…
A Classical Search Game in Discrete Locations: for any optimal hiding strategy, the searcher has an optimal strategy mixing at most n Gittins search sequences that each break all ties by one orderResearch Paper
An object is hidden in one of n boxes. Each search of box i costs time ti, and if the object is there it is found with probability qi, independently of all earlier searches. When the searcher knows the probabilities pi with which the object was placed, the problem has a classical index solution. Norris (1962), Bram (1963), Blackwell (reported by Matula,…
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences: Revenue Lower Bound for the Assignment Rounded from Dynamic-Programming ActionsResearch Paper
Retailers, online travel agencies and search engines display products in an ordered list or on a physical layout, and customers inspect only a prefix of it. Display optimization asks how to assign products to positions so as to maximize expected revenue when each customer considers only the products shown in the first k positions, with k random. Aouad and…
Heteroscedastic Exponomial Choice: Under Independent Exponential Utility Errors with Choice-Specific Rates, Every Choice Probability Is a Closed-Form ExponomialResearch Paper
Random utility models are the standard way to turn utilities into demand in operations management, marketing and economics. A consumer facing n products assigns each a random utility and buys the one with the highest realization; the choice probabilities are the market shares that pricing and assortment models optimize. The multinomial logit, built on…
Distributed Stochastic Optimization with Large Delays: Under Polynomially Growing Delays, Asynchronous SGD with Tuned Step-Sizes Drives the Mean-Square Gradient Norm to ZeroResearch Paper
Large-scale learning problems, such as empirical risk minimization over millions of samples, are solved in practice by stochastic gradient descent (SGD) run on many processors at once. In a master–worker system, or in a multi-processor system with shared memory, a worker reads the current parameter, computes a stochastic gradient and writes its update back.…
The Regularity of the Value Function of Repeated Games with Switching Costs: The Value Is Continuous, Increasing, Concave, Piecewise Linear and Eventually Constant in the Switching-Cost WeightResearch Paper
Many repeated interactions charge a player not only for what is played at each stage but also for changing what is played: a firm that reconfigures production, a defender that relocates patrols, a server that migrates jobs. Switching costs model this. In a zero-sum repeated game with switching costs, player 2 pays player 1 a stage payoff that depends on the…
Online Hypergraph Matching with Delays: Randomized Batching with Depth-k Greedy Is 1/d-Competitive for Online-(k, d)-Max-MatchingResearch Paper
Ride-pooling platforms receive trip requests one at a time and must decide, within a short waiting window, which requests to group into a shared vehicle. A request that is not grouped before its window closes is served alone or lost. Online hypergraph matching with delays is the combinatorial core of this decision: requests are vertices that arrive over…
Efficient Allocations in Double Auction Markets: Repeated Double Auctions Drive the Consumer Surplus to Zero at Rate 1/t and Their Cluster Points Are Individually Rational Pareto AllocationsResearch Paper
Double auctions match buy and sell orders at a common price. Stock exchanges, commodity markets and electricity markets use them at their opening and closing auctions and to trade multi-asset portfolios. Economists have long asked how efficient the resulting allocations are. Laboratory work starting with Smith (1962) found that repeated double auctions with…