Rank-Based Methods for the Analysis of Auctions
A new method is proposed for the analysis of first price and all pay auctions, where bidding functions are written not as functions of values but as functions of the rank or quantile of the bidder's value in the distribution from which it was drawn. This method gives new results in both symmetric and asymmetric cases with independent values. It is shown that under this new method if one bidder has a stochastically higher distribution of values then her bidding function in terms of rank will always be higher than her rival's. This is a clearer result under weaker conditions than using standard methods. We also look at auctions where one bidder has more precise information than the other.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
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.:
- Lebrun, Bernard, 2006.
"Uniqueness of the equilibrium in first-price auctions,"
Games and Economic Behavior,
Elsevier, vol. 55(1), pages 131-151, April.
- Bernard Lebrun, 2004. "Uniqueness of the Equilibrium in First-Price Auctions," Discussion Papers 1, York University, Department of Economics, revised May 2004.
- Bernard Lebrun, 2004. "Uniqueness of the Equilibrium in First-Price Auctions," Working Papers 2004_2, York University, Department of Economics.
- Eric Maskin & John Riley, 2000. "Equilibrium in Sealed High Bid Auctions," Review of Economic Studies, Oxford University Press, vol. 67(3), pages 439-454.
- Amann, Erwin & Leininger, Wolfgang, 1996. "Asymmetric All-Pay Auctions with Incomplete Information: The Two-Player Case," Games and Economic Behavior, Elsevier, vol. 14(1), pages 1-18, May.
- Lebrun, Bernard, 1999. "First Price Auctions in the Asymmetric N Bidder Case," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 40(1), pages 125-142, February.
- Lebrun, Bernard, 1997. "First Price Auctions in the Asymmetric N Bidder Case," Cahiers de recherche 9715, Université Laval - Département d'économique.
- Krishna, Vijay, 2002. "Auction Theory," Elsevier Monographs, Elsevier, edition 1, number 9780124262973.
- Lebrun, Bernard, 1998. "Comparative Statics in First Price Auctions," Games and Economic Behavior, Elsevier, vol. 25(1), pages 97-110, October.
- Ed Hopkins & Tatiana Kornienko, 2007. "Cross and Double Cross: Comparative Statics in First Price Auctions," Levine's Bibliography 321307000000000831, UCLA Department of Economics.
- Hopkins Ed & Kornienko Tatiana, 2007. "Cross and Double Cross: Comparative Statics in First Price and All Pay Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 7(1), pages 1-25, May. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:cla:levrem:122247000000001900. 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: (David K. Levine)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.