IDEAS home Printed from https://ideas.repec.org/p/lec/leecon/08-24.html

A Dynamic Mechanism and Surplus Extraction Under Ambiguity

Author

Listed:
  • Subir Bose

  • Arup Daripa

Abstract

In the standard independent private values (IPV)model, each bidder’s beliefs about the values of any other bidder is represented by a unique prior. In this paper we relax this assumption and study the question of auction design in an IPV setting characterized by ambiguity: bidders have an imprecise knowledge of the distribution of values of others, and are faced with a set of priors. We also assume that their preferences exhibit ambiguity aversion; in particular, they are represented by the epsilon-contamination model. We show that a simple variation of a discrete Dutch auction can extract almost all surplus. This contrasts with optimal auctions under IPV without ambiguity as well as with optimal static auctions with ambiguity - in all of these, types other than the lowest participating type obtain a positive surplus. An important point of departure is that the modified Dutch mechanism we consider is dynamic rather than static, establishing that under ambiguity aversion – even when the setting is IPV in all other respects – a dynamic mechanism can have additional bite over its static counterparts.

Suggested Citation

  • Subir Bose & Arup Daripa, 2008. "A Dynamic Mechanism and Surplus Extraction Under Ambiguity," Discussion Papers in Economics 08/24, Division of Economics, School of Business, University of Leicester.
  • Handle: RePEc:lec:leecon:08/24
    as

    Download full text from publisher

    File URL: https://www.le.ac.uk/economics/research/RePEc/lec/leecon/dp08-24.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:lec:leecon:08/24. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Abbie Sleath (email available below). General contact details of provider: https://edirc.repec.org/data/deleiuk.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.