We study a contest with multiple, nonidentical prizes. Participants are privately informed about a parameter (ability) affecting their costs of effort. The contestant with the highest effort wins the first prize, the contestant with the second-highest effort wins the second prize, and so on until all the prizes are allocated. The contest's designer maximizes expected effort. When cost functions are linear or concave in effort, it is optimal to allocate the entire prize sum to a single "first" prize. When cost functions are convex, several positive prizes may be optimal.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 91 (2001) Issue (Month): 3 (June) Pages: 542-558 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
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.:
Roger B. Myerson, 1978.
"Optimal Auction Design,"
Discussion Papers
362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Riley, John G & Samuelson, William F, 1981.
"Optimal Auctions,"
American Economic Review,
American Economic Association, vol. 71(3), pages 381-92, June.
[Downloadable!] (restricted)
Other versions:
Varian, Hal R, 1980.
"A Model of Sales,"
American Economic Review,
American Economic Association, vol. 70(4), pages 651-59, September.
[Downloadable!] (restricted)
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.) This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.