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

Monotonicity and Rationalizability in a Large First Price Auction

Author

Listed:
  • In-Koo Cho

Abstract

This paper proves that the monotonicity of bidding strategies together with the rationality of bidders implies that the winning bid in a first price auction converges to the competitive equilibrium price as the number of bidders increases ( Wilson, 1977 ). Instead of analysing the symmetric Nash equilibrium, we examine rationalizable strategies ( Bernheim (1984) , Pearce (1984) ) among the set of monotonic bidding strategies to prove that any monotonic rationalizable bidding strategy must be within a small neighbourhood of the "truthful" valuation of the object, conditioned on the signal received by the bidder. We obtain an information aggregation result similar to that of Wilson (1977) , while dispensing with almost all symmetric assumptions and using a milder solution concept than the Nash equilibrium. In particular, if every bidder is ex ante identical, then any rationalizable bidding strategy must be within a small neighbourhood of the symmetric Nash equilibrium. In a symmetric first price auction, the symmetry of outcomes is implied rather than assumed. Copyright 2005, Wiley-Blackwell.

Suggested Citation

  • In-Koo Cho, 2005. "Monotonicity and Rationalizability in a Large First Price Auction," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 72(4), pages 1031-1055.
    • Handle: RePEc:oup:restud:v:72:y:2005:i:4:p:1031-1055
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/0034-6527.00360
    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. Bernhard Kasberger & Karl H. Schlag, 2017. "Robust Bidding in First-Price Auctions: How to Bid without Knowing what Otheres are Doing," Vienna Economics Papers 1707, University of Vienna, Department of Economics.
    2. Bernhard Kasberger & Karl H. Schlag, 2017. "Robust Bidding in First-Price Auctions: How to Bid without Knowing what Otheres are Doing," Vienna Economics Papers vie1707, University of Vienna, Department of Economics.
    3. Makoto Shimoji, 2017. "Revenue comparison of discrete private-value auctions via weak dominance," Review of Economic Design, Springer;Society for Economic Design, vol. 21(4), pages 231-252, December.
    4. Azrieli Yaron & Levin Dan, 2012. "Dominance Solvability of Large k-Price Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-11, May.
    5. Mason, Robin & Valentinyi, Ã kos, 2007. "The existence and uniqueness of monotone pure strategy equilibrium in Bayesian games," Discussion Paper Series In Economics And Econometrics 710, Economics Division, School of Social Sciences, University of Southampton.
    6. Azrieli, Yaron & Levin, Dan, 2011. "Dominance-solvable common-value large auctions," Games and Economic Behavior, Elsevier, vol. 73(2), pages 301-309.
    7. Robles Jack & Shimoji Makoto, 2012. "On Rationalizability and Beliefs in Discrete Private-Value First-Price Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-21, May.
    8. Mason, Robin & Valentinyi, Ã kos, 2007. "The existence and uniqueness of monotone pure strategy equilibrium in Bayesian games," Discussion Paper Series In Economics And Econometrics 0710, Economics Division, School of Social Sciences, University of Southampton.

    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:72:y:2005:i:4:p:1031-1055. 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.