Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/24346
Title: | Optimal monopoly mechanisms with demand uncertainty |
Authors: | Peck, James Rampal, Jeevant |
Keywords: | Monopoly mechanism;Correlated valuations;Bayesian incentive compatibility;Ex post individual rationality |
Issue Date: | 10-Mar-2021 |
Publisher: | INFORMS: Institute for Operations Research and the Management Sciences |
Citation: | James Peck, Jeevant Rampal (2021) Optimal Monopoly Mechanisms with Demand Uncertainty. Mathematics of Operations Research 0(0):null. https://doi.org/10.1287/moor.2020.1120 |
Abstract: | This paper analyzes a monopoly firm’s profit-maximizing mechanism in the following context. There is a continuum of consumers with a unit demand for a good. The distribution of the consumers’ valuations is given by one of two possible demand distributions/states. The consumers are uncertain about the demand state, and they update their beliefs after observing their own valuation for the good. The firm is uncertain about the demand state but infers it from the consumers’ reported valuations. The firm’s problem is to maximize profits by choosing an optimal mechanism among the class of anonymous, deterministic, direct revelation mechanisms that satisfy interim incentive compatibility and ex post individual rationality. We show that, under certain sufficient conditions, the firm’s optimal mechanism is to set the monopoly price in each demand state. Under these conditions, Segal’s optimal ex post mechanism is robust to relaxing ex post incentive compatibility to interim incentive compatibility. |
URI: | http://hdl.handle.net/11718/24346 |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Optimal Monopoly Mechanisms with Demand Uncertainty.pdf Restricted Access | Optimal Monopoly Mechanisms with Demand Uncertainty | 733.19 kB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.