We study asymmetric all-pay auctions where two privately informed agents bid for a prize. We show that capping the bids is profitable for a designer who wants to maximize the sum of bids (revenue). This finding confims the results of Che and Gale (1998) in the context of incomplete information and completes the analysis of Gavious, Moldovanu and Sela (2002) by analyzing the case of ex-ante asymmetric players.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Article provided by Economics Bulletin in its journal Economics Bulletin.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
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.:
PARREIRAS, SŽrgio O. & RUBINCHIK-PESSACH, Anna, 2006.
"Contests with heterogeneous agents,"
CORE Discussion Papers
2006004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
[Downloadable!]
Cited by: (explanations, 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.)