Caps In Sequential Contests
We study a sequential two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize and each player may win either one or two prizes. The designer may impose a cap on the players' bids in each of the stages. We analyze the equilibrium in this sequential all-pay auction with bid caps and show that capping the players' bids is pro?table for a designer who wishes to maximize the players' expected total bid.
|Date of creation:||2010|
|Contact details of provider:|| Postal: P.O.B 653, Beer-Sheva 8410501|
Web page: http://www.bgu.ac.il/econ
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.:
When requesting a correction, please mention this item's handle: RePEc:bgu:wpaper:1007. 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: (Aamer Abu-Qarn)
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.