Two-Stage Contests with Preferences over Style
Many grant applications have a preliminary stage where only a select group are invited to submit a full application. Similarly, procurement contracts by governments are often awarded through a two-stage procedure. We model and analyze such environments where the designer cares about the style of the application as well as its quality. The designer has the option of choosing an initial stage, where contestants can enter and learn about their desirability while the designer learns about their style. We determine closed form solutions for equilibrium outcomes and designer payoffs and use this to analyze design questions regarding whether or not a second stage is desirable, different rules for deciding who will advance, as with whether or not to communicate the number of contestants that qualify for the second stage.
(This abstract was borrowed from another version of this item.)
|Date of creation:||2016|
|Contact details of provider:|| Postal: P.O.B 653, Beer-Sheva 8410501|
Web page: http://www.bgu.ac.il/econ
More information through EDIRC
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.:
- Sheremeta, Roman M., 2010.
"Experimental comparison of multi-stage and one-stage contests,"
Games and Economic Behavior,
Elsevier, vol. 68(2), pages 731-747, March.
- Sheremeta, Roman, 2009. "Experimental Comparison of Multi-Stage and One-Stage Contests," MPRA Paper 49884, University Library of Munich, Germany.
- Roman M. Sheremeta, 2009. "Experimental Comparison of Multi-Stage and One-Stage Contests," Working Papers 09-04, Chapman University, Economic Science Institute.
- McAfee, R. Preston & McMillan, John, 1987. "Auctions with a stochastic number of bidders," Journal of Economic Theory, Elsevier, vol. 43(1), pages 1-19, October.
- Kaplan, Todd R. & Luski, Israel & Wettstein, David, 2003. "Innovative activity and sunk cost," International Journal of Industrial Organization, Elsevier, vol. 21(8), pages 1111-1133, October.
- Kaplan, T.R. & Luski, I. & Wettstein, D., 2000. "Innovative Activity and Sunk Cost," Papers 2000-6, Tel Aviv.
- Kaplan, T.R. & Luski, I. & Wettstein, D., 2000. "Innovative Activity and Sunk Cost," Discussion Papers 0006, Exeter University, Department of Economics.
- Qiang Fu & Qian Jiao & Jingfeng Lu, 2015. "Contests with endogenous entry," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 387-424, May.
- repec:eee:mateco:v:70:y:2017:i:c:p:66-73 is not listed on IDEAS
- Fu, Qiang & Jiao, Qian & Lu, Jingfeng, 2014. "Disclosure policy in a multi-prize all-pay auction with stochastic abilities," Economics Letters, Elsevier, vol. 125(3), pages 376-380.
- Dan Kovenock & Michael R. Baye & Casper G. de Vries, 1996. "The all-pay auction with complete information (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 291-305.
- Baye, M. & Kovenock, D. & de Vries, C., 1990. "The All-Pay Auction with Complete Information," Discussion Paper 1990-51, Tilburg University, Center for Economic Research.
- Michael R. Baye & Dan Kovenock & Casper De Vries, 1995. "The All-pay Auction with Complete Information," CESifo Working Paper Series 90, CESifo Group Munich.
- Kovenock, D. & de Vries, C.G., 1995. "The All-Pay Auction with Complete Information," UFAE and IAE Working Papers 311.95, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Baye, M.R. & Kovenock, D. & De Varies, C.G., 1990. "The All-Pay Auction With Complete Information," Papers 9051, Tilburg - Center for Economic Research.
- Baye, M.R. & Kovenock, D. & De Vries, C., 1992. "The All-Pay Auction with Complete Information," Papers 8-92-1, Pennsylvania State - Department of Economics.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1991. "The All-Pay Auction With Complete Information," Purdue University Economics Working Papers 1007, Purdue University, Department of Economics.
- Todd Kaplan, 2012. "Communication of preferences in contests for contracts," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(2), pages 487-503, October.
- Kaplan, Todd R, 2008. "Communication of Preferences in Contests for Contracts," MPRA Paper 18696, University Library of Munich, Germany, revised 08 Aug 2009.
- Qiang Fu & Qian Jiao & Jingfeng Lu, 2011. "On disclosure policy in contests with stochastic entry," Public Choice, Springer, vol. 148(3), pages 419-434, September.
- Sela, Aner, 2011. "Best-of-three all-pay auctions," Economics Letters, Elsevier, vol. 112(1), pages 67-70, July.
- Aner Sela, 2012. "Sequential two-prize contests," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(2), pages 383-395, October. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:bgu:wpaper:1607. 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.