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.
A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents: The Gaussian Gittins Index Equals the Posterior γ-Quantile μ + Φ⁻¹(γ)σ up to o(1) as γ → 1Research Paper
A Gittins index assigns a number to an uncertain arm in a discounted bandit problem. The index converts a sequential choice, where an agent may keep gathering information or retire, into a tax threshold for playing the arm. Computing it generally requires an optimal stopping calculation. A Bayesian upper confidence bound, by comparison, is a quantile of the…
Computation of Dynamic Equilibria in Series-Parallel Networks: The Thin-Flow Label Function of a Series-Parallel Network Has at Most 2|A′| − |A*| − |V| + 1 BreakpointsResearch Paper
In the fluid queuing model (Vickrey's model) of flows over time, a continuum of infinitesimal particles travels from a source s to a sink t through a network whose arcs have capacities and transit times. Each particle picks a route that minimizes its own arrival time, and a dynamic equilibrium (a Nash flow over time) is a flow in which no particle can…
Geometric Deep Learning VIII: An RNN Seeded at a Fixed Point h⁽⁰⁾ = R(0, h⁽⁰⁾) Is Equivariant to Left Shifts of a Zero-Padded Input SequenceTextbook
A recurrent neural network (RNN) processes an ordered stream while retaining a summary of earlier inputs. The same update rule is applied at every time step, so it is natural to ask whether shifting the input stream simply shifts the resulting sequence of summaries. The answer depends on how the run begins. The first summary is supplied as an initial state,…
Geometric Deep Learning III: An n × n Matrix Commutes with the Cyclic Shift S if and only if It Is Circulant, So Convolution Is Shift EquivarianceTextbook
Convolutional neural networks process images, audio and time series with layers whose weights are shared across positions. The Geometric Deep Learning programme of Bronstein, Bruna, Cohen and Veličković (arXiv:2104.13478v2) explains this architecture by symmetry: on a grid the relevant symmetry is translation, and a linear layer that respects translations…
Follow the Crowd with Uncertain Service Capacity: A Customer Who Infers Capacity from the Queue Length Follows the Crowd if and only if the Reward-Cost Ratio Lies in an Inference IntervalResearch Paper
Whether a customer joins a queue depends on how long she expects to wait. In the classical observable-queue model of Naor (1969), the service rate is known, and a longer queue only means a longer wait: customers avoid the crowd (ATC), so the more willing others are to join, the less willing the individual is. Many services do not publish their capacity.…
Invite Your Friend and You’ll Move Up in Line: Optimal Design of Referral Priority Programs: A Unique Cutoff Base Market Size Separates Partial Priority, Full Priority and Strategic DelayResearch Paper
Firms launching a new product often open a sign-up waitlist before they can serve everyone, and many of them reward customers who invite friends with a better place in line. Robinhood (commission-free trading) and x.ai (AI email scheduling) ran such referral priority programs, the first with full priority for referrers and the second with a partial jump in…
Simulation of a Random Variable and its Application to Game Theory: With a Leaked Randomness Source, Alice Can Secure J_cav(H(X|Y)) in the n-Stage Repeated Game up to the Error Term (10)Research Paper
A mixed strategy assumes a player can draw from any distribution. A real player may only have a limited or imperfect source of randomness, and an opponent may observe part of it. Repeated games with bounded randomness ask how much a player can guarantee in that situation. Gossner and Vieille (2002, Games Econ. Behav. 41(2), 206–226) studied a repeated…
Curtailing Bank Loan and Loan Insurance Under Risk Regulations in Supply Chain Finance: In the Insurance-Cooperation Region a Lower Initial Loan Limit and a Higher Fixed Bank Fee Benefit the SupplierResearch Paper
Small retailers often cannot pay for their orders out of their own capital and borrow from banks to do so. Banks in turn are regulated: risk-control rules such as value-at-risk caps limit how much they may lend against an uncertain revenue, and they charge fixed fees to process a loan. Loan insurance, offered by insurers or guaranteed by governments,…
Implicit Incentives and Delegation in Teams: Delegating the Production Method Can Be Strictly Cheaper than Centralisation in a Collusion-Proof EquilibriumResearch Paper
A principal who cannot observe workers' effort must use payments tied to an observable result. In a team, each worker's effort affects the same result, so an individual bonus must support both workers' incentives. The principal may also choose who controls the production method. Giving that choice to a worker changes the actions the workers can take after a…
Too Much Information: When Does Additional Testing Benefit Schools? A Free Interim Assessment Helps a School Starting Behind Only in Two Budget Regions, and Never Without Baseline ProficiencyResearch Paper
School districts in the United States are held to end-of-year proficiency targets, and many pay teachers a school-level merit-based incentive when the school is proficient at the year's standardized test. Alongside such pay schemes, districts buy interim assessments: mid-year tests that reveal where a school stands, at a reported cost of 15–20 or more per…
Lipschitz Bernoulli Utility Functions: A Preorder on Finite-Mean Lotteries Is Lipschitz and Affine if and only if It Has a Lipschitz Expected Multi-Utility RepresentationResearch Paper
Expected utility theory describes a decision maker who ranks risky prospects (probability distributions over outcomes) by the expected value of a Bernoulli utility function on the outcomes. The classical von Neumann–Morgenstern theorem, extended by Grandmont to separable metric outcome spaces, says that a complete preference over lotteries has a continuous…
Stationary Waiting Time in Parallel Queues with Synchronization: For Jobs of Fixed Size, the Waiting Time Converges with All Moments to the Endogenous Solution of a High-Order Lindley EquationResearch Paper
Parallel computing systems split each incoming job into pieces that are processed simultaneously on several servers. When the pieces of one job must also start together, each server keeps the order of arrival, and a job cannot begin until every server it needs has finished its earlier work, the result is a synchronized parallel queue. Waiting times in this…
Penalty and Augmented Lagrangian Methods for Constrained DC Programming: Feasible Accumulation Points of the Penalty Method Are B-Stationary under the Pointwise Slater Constraint QualificationResearch Paper
A DC function is a difference of two convex functions. Programs whose objective and constraints are DC functions model sparse estimation with nonconvex penalties, affine sparsity constraints, piecewise-affine regression and several problems in signal processing and finance. Constraints of DC type make the feasible region nonconvex and nonsmooth, and the…
Discrete Choice Prox-Functions on the Simplex: The Convex Conjugate of an Additive Random Utility Surplus Function Is a Prox-Function on the SimplexResearch Paper
Prox-functions determine how subgradient and mirror-type optimization methods turn a direction of improvement into the next feasible point. On a probability simplex, that step should respect the geometry of probability vectors and be computable from the current direction. The entropic prox-function gives the softmax rule, familiar from the logit model of…
High Discounts and Low Fundamental Surplus: An Equivalence Result for Unemployment Fluctuations: Tightness with Risk Premia Equals Tightness of an Artificial Economy Without Risk PremiaResearch Paper
In the search-and-matching model of the labor market (Diamond–Mortensen–Pissarides), firms post vacancies until the expected value of a vacancy is zero, so how many jobs exist depends on how firms value future match cashflows. Shimer (2005) showed that the standard calibration produces unemployment fluctuations far smaller than in the data. Two explanations…
Optimal Control of an Epidemic through Social Distancing: Under Limited Capacity Effects Every Optimal Policy Is Single-Peaked and Infections Are Log-Concave While Measures EscalateResearch Paper
During the Covid-19 epidemic, governments had to decide not only whether to impose social distancing but how to schedule it over time: when to escalate, when to relax, and whether a relaxation might later have to be reversed. Epidemiology supplies the dynamics (the SIR model of Kermack and McKendrick, 1927), and optimal control supplies the language for…
Incomplete Contracts in Multi-period Procurement: An English Auction with a Take-It-or-Leave-It Offer Attains the Optimal Complete-Contract Buyer SurplusResearch Paper
Public and private buyers often procure the same input over several periods from a pool of competing suppliers: road maintenance, defence supply, energy, and IT services are typical cases. Between periods, conditions change. Input prices, regulations or technology shift, and so does the cost of serving the contract. A buyer who can write a complete contract…
Inventory Sharing Under Service Competition: With Exogenous Inventories the Highest Non-Moot Transfer Price Is Optimal and Beats No Sharing, yet No Transfer Price Coordinates the RetailersResearch Paper
Inventory sharing (also called lateral transshipment) lets a retailer that runs short buy leftover stock from another retailer instead of placing an expensive emergency order. Between retailers under one owner, or retailers that do not compete, pooling is known to raise profits, and a suitably chosen transfer price can make independent retailers act exactly…
Characterizing and Computing the Set of Nash Equilibria via Vector Optimization: Shared Constraint Nash Equilibria Are Exactly the Pareto Optimal Points Under a Non-Convex Ordering ConeResearch Paper
A Nash equilibrium is a feasible choice of strategies at which no player can lower her own cost by changing her strategy alone. A Pareto minimizer is a feasible point that cannot be improved under a specified comparison of vector outcomes. These ideas usually select different points: a change that helps several players at once is relevant to ordinary Pareto…
Multidimensional Targeting and Consumer Response: With a Small Ad Cost and a Click Cost Just Below the md-Equilibrium Threshold, Single-Dimensional Targeting Is Strictly More ProfitableResearch Paper
Firms that advertise online choose whom to target from the customer data they hold, and the industry's working assumption is that more granular data can only help: a firm that knows more about each consumer can at worst ignore the extra information. Despotakis and Yu (SSRN 3900394; Management Science, 2022, doi:10.1287/mnsc.2022.4604) show that this fails…
Network Inspection for Detecting Strategic Attacks: The Equilibrium Detection Rate and Inspection Strategies Do Not Depend on the Attacker's Number of ResourcesResearch Paper
Utility networks such as water pipelines, gas distribution systems and power grids are exposed to attacks on their physical components. An operator who cannot monitor every component must decide where to place a limited number of detectors, without knowing which components an adversary will target or how many of them. Dahan, Sela and Amin (arXiv:1705.00349,…
Bank Competition and Risk-Taking Under Market Integration: Integration Lowers Loan Rates and Risk-Taking in the Borrower-Heavy Market, and a Strong Bank-Customer Effect Raises Them in the OtherResearch Paper
Whether more competition among banks makes the financial system safer or more fragile is a long-running question in banking theory and regulation. The competition-fragility view holds that competition erodes bank margins and charter values and so encourages risk-taking; the competition-stability view, formalized by Boyd and De Nicolò (2005), holds that…
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users: The Liquid Price of Anarchy of the Kelly Mechanism Is Exactly 2Research Paper
Resource allocation mechanisms distribute a divisible good among users who report numerical signals. In a network, the good can represent capacity; in a computing system, processing time. The mechanism sees the signals, allocates shares, and charges payments, but it does not know each user's value for a share or the most the user can pay. Those private…
The Design of Optimal Pay-as-Bid Procurement Mechanisms: Every Optimal Equitable Assortment Mechanism Is Matched by a k-Soft-Reserve Rule in the Symmetric Two-Point Cost ModelResearch Paper
Public procurement agencies and group-buying platforms increasingly run framework agreements: suppliers post prices, and the agency then decides which suppliers' products appear in the catalogue from which buyers choose. Chile's ChileCompra framework agreements and drug formularies work this way. The agency faces a trade-off. Showing many products serves…
ε-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations: The Last Record-Breaking Dyadic Level Has Finite Exponential Moments and Bounds the Uniform ErrorResearch Paper
Fractional Brownian motion (fBM) is the standard Gaussian model of long-range dependence and rough paths. It appears in network traffic, finance (rough volatility), hydrology and queueing, and it drives a class of stochastic differential equations whose solutions are defined pathwise by Young integration. Simulating such models needs sample paths of fBM,…