IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v75y2008i2p475-498.html
   My bibliography  Save this article

Sequential Common-Value Auctions with Asymmetrically Informed Bidders

Author

Listed:
  • Johannes Hörner
  • Julian Jamison

Abstract

We study an infinitely repeated first-price auction with common values. We focus on one-sided incomplete information, in which one bidder learns the objects' value, which itself does not change over time. Learning by the uninformed bidder occurs only through observation of the bids. The proprietary information is eventually revealed, and the seller extracts essentially the entire rent (for large discount factors). Both players' pay-offs tend to 0 as the discount factor tends to 1. However, the uninformed bidder does relatively better than the informed bidder. We discuss the case of two-sided incomplete information and argue that, under a Markovian refinement, the outcome is pooling as information is revealed only insofar as it does not affect prices. Copyright 2008, Wiley-Blackwell.

Suggested Citation

  • Johannes Hörner & Julian Jamison, 2008. "Sequential Common-Value Auctions with Asymmetrically Informed Bidders," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 75(2), pages 475-498.
    • Handle: RePEc:oup:restud:v:75:y:2008:i:2:p:475-498
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1467-937X.2008.00476.x
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schweinzer, Paul, 2010. "Sequential bargaining with common values," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 109-121, January.
    2. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    3. Jacquemet, Nicolas & Koessler, Frédéric, 2013. "Using or hiding private information? An experimental study of zero-sum repeated games with incomplete information," Games and Economic Behavior, Elsevier, vol. 78(C), pages 103-120.
    4. Emmanuel LORENZON, 2020. "Uninformed Bidding in Sequential Auctions," Bordeaux Economics Working Papers 2020-20, Bordeaux School of Economics (BSE).
    5. Dennis Clerck & Erik Demeulemeester, 2016. "A sequential procurement model for a PPP project pipeline," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 427-457, March.
    6. Amir Danak & Shie Mannor, 2012. "Approximately optimal bidding policies for repeated first-price auctions," Annals of Operations Research, Springer, vol. 196(1), pages 189-199, July.
    7. Rao, Neel, 2015. "General training in labor markets: Common value auctions with unobservable investment," Journal of Economic Behavior & Organization, Elsevier, vol. 120(C), pages 19-45.
    8. David Malueg & Ram Orzach, 2012. "Equilibrium and revenue in a family of common-value first-price auctions with differential information," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(2), pages 219-254, May.
    9. Alejandro Francetich, 2013. "Becoming the Neighbor Bidder: Endogenous Winner’s Curse in Dynamic Mechanisms," Working Papers 501, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
    10. Harrison Cheng & Guofu Tan, 2010. "Asymmetric common-value auctions with applications to private-value auctions with resale," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 45(1), pages 253-290, October.
    11. Paul Pezanis-Christou, 2013. "Asymmetric Multiple-Object First-Price Auctions," School of Economics and Public Policy Working Papers 2013-07, University of Adelaide, School of Economics and Public Policy.

    More about this item

    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:oup:restud:v:75:y:2008:i:2:p:475-498. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.