An Ascending Auction in the Presence of Rationality and Herd Behaviour
In this paper we analyse a common value English auction. We argue that rational bidders attempt to estimate each other’s private signals, to take advantage of the additional information disclosed through the bids. If this happens, herd behaviour might arise, because a particular bidder may have an incentive to follow his estimate of some other bidder’s signal, thus dropping his own, and staying in the auction longer than previously optimal. Acting upon beliefs might take the auction to an inefficient outcome, where the bidder who most values the good ends up not getting the object for sale.
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Postal: Department of Economics and Related Studies, University of York, York, YO10 5DD, United Kingdom|
Phone: (0)1904 323776
Web page: http://www.york.ac.uk/economics/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Milgrom, Paul R & Weber, Robert J, 1982.
"A Theory of Auctions and Competitive Bidding,"
Econometric Society, vol. 50(5), pages 1089-1122, September.
- Christopher Avery & John H. Kagel, 1997. "Second-Price Auctions with Asymmetric Payoffs: An Experimental Investigation," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 573-603, 09.
- McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
When requesting a correction, please mention this item's handle: RePEc:yor:yorken:99/8. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Paul Hodgson)
If references are entirely missing, you can add them using this form.