A Property of Solutions to Linear Monopoly Problems

Abstract

We extend the “no-haggling” result of Riley and Zeckhauser (1983) to the class of linear multiproduct monopoly problems when the buyer’s valuations are smoothly distributed. In particular, we show that there is no loss for the seller in optimizing over mechanisms such that all allocations belong to the boundary of the feasible set. The set of potentially optimal mechanisms can be further restricted when the costs are sufficiently low: the optimal mechanisms use only allocations from the “north-east” boundary of the feasible set and the null allocation.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 35 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.