Pricing Without Priors
11 Pages Posted: 11 Sep 2007
Date Written: September 2007
Abstract
We consider the problem of pricing a single object when the seller has only minimal information about the true valuation of the buyer. Specifically, the seller only knows the support of the possible valuations and has no further distributional information.
The seller is solving this choice problem under uncertainty by minimizing her regret. The pricing policy hedges against uncertainty by randomizing over a range of prices. The support of the pricing policy is bounded away from zero. Buyers with low valuations cannot generate substantial regret and are priced out of the market. We generalize the pricing policy without priors to encompass many buyers and many qualities.
Keywords: Monopoly, Optimal pricing, Regret, Multiple priors, Distribution free
JEL Classification: C79, D82
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Information in Mechanism Design
By Dirk Bergemann and Juuso Valimaki
-
Information in Mechanism Design
By Dirk Bergemann and Juuso Valimaki
-
Information in Mechanism Design
By Dirk Bergemann and Juuso Valimaki
-
On Information and Competition in Private Value Auctions
By Juan-josé Ganuza and José Penalva
-
Linkage Principle, Multi-Dimensional Signals and Blind Auctions
By Thierry Foucault and Stefano Lovo
-
Optimal Strategic Communication: Can a Less Informed Expert Be More Informative?
-
Optimal Auctions with Information Acquisition
By Xianwen Shi
-
An Explicit Approach to Modeling Finite-Order Type Spaces and Applications
By Cheng-zhong Qin and Chun-lei Yang
-
The Organization of Expertise in the Presence of Communication