Pricing Without Priors

11 Pages Posted: 11 Sep 2007

See all articles by Dirk Bergemann

Dirk Bergemann

Yale University - Cowles Foundation - Department of Economics; Yale University - Cowles Foundation

Karl H. Schlag

University of Vienna - Department of Economics

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

Bergemann, Dirk and Schlag, Karl H., Pricing Without Priors (September 2007). Cowles Foundation Discussion Paper No. 1625. Available at SSRN: https://ssrn.com/abstract=1013570

Dirk Bergemann (Contact Author)

Yale University - Cowles Foundation - Department of Economics ( email )

28 Hillhouse Ave
New Haven, CT 06520-8268
United States
203-432-3592 (Phone)
203-432-2128 (Fax)

HOME PAGE: http://www.econ.yale.edu/~dirk/

Yale University - Cowles Foundation

Box 208281
New Haven, CT 06520-8281
United States

Karl H. Schlag

University of Vienna - Department of Economics ( email )

Oskar-Morgenstern-Platz 1
Vienna, A-1090
Austria

Register to save articles to
your library

Register

Paper statistics

Downloads
138
rank
205,458
Abstract Views
740
PlumX Metrics
!

Under construction: SSRN citations while be offline until July when we will launch a brand new and improved citations service, check here for more details.

For more information