Paperlane

no. 3 · Tuesday 27 October 2026

The monopolist's free boundary problem in the plane

Robert J. McCann, Cale Rankin and Kelvin Shuangjian Zhang

math.AP · v4 · 63 pp

Abstract

We study the Monopolist's problem with a focus on the free boundary separating bunched from unbunched consumers, especially in the plane, and give a description of $C^{1,1}(\overlineΩ)$ solutions for the family of square domains $\{(a,a+1)^2\}_{a \ge 0}$. The Monopolist's problem is fundamental in economics, yet widely considered analytically intractable when both consumers and products have more than one degree of heterogeneity. Mathematically, the problem is to minimize a smooth, uniformly convex Lagrangian over the space of nonnegative convex functions. What results is a free boundary problem between the regions of strict and nonstrict convexity. We study both the structure of the free boundary problem on convex domains in $\mathbf{R}^n$ showing that each bunch extends to this boundary and providing a proof in $\mathbf{R}^2$ that the interior free boundary can only fail to be smooth in one of four specific ways (cusp, high frequency oscillations, stray bunch, nontransversal bunch); in addition we offer a description of $C^{1,1}(\overlineΩ)$ solutions to Rochet and Choné's example on the family of squares $Ω= (a,a+1)^2$, where we discover bifurcations first to targeted and then to blunt bunching as the distance $a \ge 0$ to the origin is increased. To do this, we extend the localization for measures in convex-order to accommodate potential discontinuities in the product allocation map at the fixed boundary. We also employ techniques from the study of the Monge–Ampère equation and the obstacle problem.

comments
63 pages. Addition of a C^{1,1} assumption and small changes to the classification result
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2412.15505 ↗