IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/1625.html
   My bibliography  Save this paper

Pricing without Priors

Author

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.

Suggested Citation

  • Dirk Bergemann & Karl H. Schlag, 2007. "Pricing without Priors," Cowles Foundation Discussion Papers 1625, Cowles Foundation for Research in Economics, Yale University.
  • Handle: RePEc:cwl:cwldpp:1625
    Note: CFP 1224.
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d16/d1625.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Stoye, Jörg, 2011. "Axioms for minimax regret choice correspondences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2226-2251.
    2. Mussa, Michael & Rosen, Sherwin, 1978. "Monopoly and product quality," Journal of Economic Theory, Elsevier, vol. 18(2), pages 301-317, August.
    3. Dirk Bergemann & Karl Schlag, 2012. "Robust Monopoly Pricing," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 13, pages 417-441, World Scientific Publishing Co. Pte. Ltd..
    4. Neeman, Zvika, 2003. "The effectiveness of English auctions," Games and Economic Behavior, Elsevier, vol. 43(2), pages 214-238, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dirk Bergemann & Karl Schlag, 2012. "Robust Monopoly Pricing," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 13, pages 417-441, World Scientific Publishing Co. Pte. Ltd..
    2. René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
    3. Yang, Kai Hao, 2021. "Efficient demands in a multi-product monopoly," Journal of Economic Theory, Elsevier, vol. 197(C).
    4. René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
    5. Heidrun Hoppe & Benny Moldovanu & Emre Ozdenoren, 2011. "Coarse matching with incomplete information," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 75-104, May.
    6. Prat, Andrea & Madarász, Kristóf, 2010. "Screening with an Approximate Type Space," CEPR Discussion Papers 7900, C.E.P.R. Discussion Papers.
    7. Vinicius Carrasco & Vitor Farinha Luz & Paulo K. Monteiro & Humberto Moreira, 2019. "Robust mechanisms: the curvature case," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(1), pages 203-222, July.
    8. Kristóf Madarász & Andrea Prat, 2017. "Sellers with Misspecified Models," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 84(2), pages 790-815.
    9. Wanchang Zhang, 2022. "Auctioning Multiple Goods without Priors," Papers 2204.13726, arXiv.org.
    10. Kasberger, Bernhard & Woodward, Kyle, 2021. "Bidding in Multi-Unit Auctions under Limited Information," MPRA Paper 111185, University Library of Munich, Germany.
    11. Dirk Bergemann & Tan Gan & Yingkai Li, 2023. "Managing Persuasion Robustly: The Optimality of Quota Rules," Papers 2310.10024, arXiv.org.
    12. Mustafa Ç. Pınar, 2018. "Robust trading mechanisms over 0/1 polytopes," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 845-860, October.
    13. Suzdaltsev, Alex, 2022. "Distributionally robust pricing in independent private value auctions," Journal of Economic Theory, Elsevier, vol. 206(C).
    14. Kanishka Misra & Eric M. Schwartz & Jacob Abernethy, 2019. "Dynamic Online Pricing with Incomplete Information Using Multiarmed Bandit Experiments," Marketing Science, INFORMS, vol. 38(2), pages 226-252, March.
    15. Yingni Guo & Eran Shmaya, 2023. "Regret‐Minimizing Project Choice," Econometrica, Econometric Society, vol. 91(5), pages 1567-1593, September.
    16. Alexei Parakhonyak & Anton Sobolev, 2015. "Non‐Reservation Price Equilibrium and Search without Priors," Economic Journal, Royal Economic Society, vol. 0(584), pages 887-909, May.
    17. Benjamin R. Handel & Kanishka Misra, 2015. "Robust New Product Pricing," Marketing Science, INFORMS, vol. 34(6), pages 864-881, November.
    18. Bernhard Kasberger, 2022. "An Equilibrium Model of the First-Price Auction with Strategic Uncertainty: Theory and Empirics," Papers 2202.07517, arXiv.org, revised Mar 2022.
    19. repec:dau:papers:123456789/2348 is not listed on IDEAS
    20. Król, Michał, 2012. "Product differentiation decisions under ambiguous consumer demand and pessimistic expectations," International Journal of Industrial Organization, Elsevier, vol. 30(6), pages 593-604.
    21. Atabek Atayev, 2021. "Nonlinear Prices, Homogeneous Goods, Search," Papers 2109.15198, arXiv.org.

    More about this item

    Keywords

    Monopoly; Optimal pricing; Regret; Multiple priors; Distribution free;
    All these keywords.

    JEL classification:

    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1625. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.