Mechanism Design with Limited Information: The Case of Nonlinear Pricing
We analyze the canonical nonlinear pricing model with limited information. A seller offers a menu with a finite number of choices to a continuum of buyers with a continuum of possible valuations. By revealing an underlying connection to quantization theory, we derive the optimal finite menu for the socially efficient and the revenue-maximizing mechanism. In both cases, we provide an estimate of the loss resulting from the usage of a finite n-class menu. We show that the losses converge to zero at a rate proportional to 1/n^2 as n becomes large.
|Date of creation:||Nov 2010|
|Publication status:||Published in Rahul Jain and Rajgopal Kannan, eds., Game Theory for Networks. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, Vol. 75, 2012, pp. 1-10|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1775. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.