Robust Monopoly Pricing: The Case of Regret
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete information. The robust version of the problem is distinct in two aspects: (i) the seller minimizes regret rather than maximizes revenue, and (ii) the seller only knows that the true distribution of the valuations is in a neighborhood of a given model distribution. We characterize the robust pricing policy as the solution to a minimax problem for small and large neighborhoods. In contrast to the classic monopoly policy which is a single deterministic price, the robust policy is always a random pricing policy, or equivalently, a multi-item menu policy. The responsiveness of the robust policy to an increase in risk is determined by the curvature of the static profit function.
|Date of creation:||2005|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.eui.eu/ECO/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:eui:euiwps:eco2005/10. 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: (Rhoda Lane)
If references are entirely missing, you can add them using this form.