Multi-to -one dimensional and semi-discrete screening
Omar Abdul Halim, Brendan Pass
TL;DR
This work tackles multi‑dimensional screening by pairing a high‑dimensional consumer space with a one‑dimensional product space and introducing nestedness as a structural simplification that renders the problem tractable. It develops a semi‑discrete framework with a finite set of products and proves discrete nestedness under explicit convexity‑type conditions, enabling decoupled, one‑dimensional first‑order equations and often closed‑form solutions; it also extends the analysis to a continuum of products, showing existence of a nested solution and convergence of discrete approximations. The results connect monopolistic pricing to discrete and continuous optimal transport via $b$‑convex duality, yielding clear economic structure: when nested, agents’ choices partition neatly into consecutive product regimes with non‑intersecting indifference curves and a simple pricing rule. The approaches yield both analytical and efficient numerical methods, with explicit solutions in key cases and a rigorous continuum limit, offering a practical pathway to solving high‑dimensional screening problems in economics and related fields.
Abstract
We study the monopolist's screening problem with a multi-dimensional distribution of consumers and a one-dimensional space of goods. We establish general conditions under which solutions satisfy a structural condition known as nestedness, which greatly simplifies their analysis and characterization. Under these assumptions, we go on to develop a general method to solve the problem, either in closed form or with relatively simple numerical computations, and illustrate it with examples. These results are established both when the monopolist has access to only a discrete subset of the one-dimensional space of products, as well as when the entire continuum is available. In the former case, we also establish a uniqueness result.
