Ranking asymmetric auctions: Filling the gap between a distributional shift and stretch
Rene Kirkegaard
Games and Economic Behavior, 2014, vol. 85, issue C, 60-69
Abstract:
I consider first-price auctions (FPA) and second-price auctions (SPA) with two asymmetric bidders. The FPA is known to be more profitable than the SPA if the strong bidder's distribution function is convex and the weak bidder's distribution is obtained by truncating or horizontally shifting the former. In this paper, I employ a new mechanism design result to show that the FPA remains optimal if the weak bidder's distribution falls between the two benchmarks in a natural way. The same conclusion holds if the strong bidder's distribution is concave, but with a vertical shift replacing the horizontal shift. A result with a similar flavor holds if the strong bidder's distribution is neither convex nor concave. The dispersive order and the star order prove useful in comparing the weak bidder's distribution to the benchmarks. A key step establishes a relationship between these orders and reverse hazard rate dominance.
Keywords: Asymmetric auctions; Dispersive order; Revenue ranking; Star order (search for similar items in EconPapers)
JEL-codes: D44 D82 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825614000219
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:85:y:2014:i:c:p:60-69
DOI: 10.1016/j.geb.2014.01.016
Access Statistics for this article
Games and Economic Behavior is currently edited by E. Kalai
More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().