On disclosure of participation in innovation contests: a dominance result
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-023-05416-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Benny Moldovanu & Aner Sela, 2008.
"The Optimal Allocation of Prizes in Contests,"
Springer Books, in: Roger D. Congleton & Arye L. Hillman & Kai A. Konrad (ed.), 40 Years of Research on Rent Seeking 1, pages 615-631,
Springer.
- Benny Moldovanu & Aner Sela, 2001. "The Optimal Allocation of Prizes in Contests," American Economic Review, American Economic Association, vol. 91(3), pages 542-558, June.
- Moldovanu, Benny & Sela, Aner, 1999. "The Optimal Allocation of Prizes in Contests," Sonderforschungsbereich 504 Publications 99-75, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Moldovanu, Benny & Sela, Aner, 1999. "The optimal allocation of prizes in contests," Papers 99-75, Sonderforschungsbreich 504.
- F. Bonomo & J. Catalán & G. Durán & R. Epstein & M. Guajardo & A. Jawtuschenko & J. Marenco, 2017. "An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools," Annals of Operations Research, Springer, vol. 258(2), pages 569-585, November.
- Qiang Fu & Jingfeng Lu & Jun Zhang, 2016.
"Disclosure policy in Tullock contests with asymmetric stochastic entry,"
Canadian Journal of Economics/Revue canadienne d'économique, John Wiley & Sons, vol. 49(1), pages 52-75, February.
- Qiang Fu & Jingfeng Lu & Jun Zhang, 2016. "Disclosure policy in Tullock contests with asymmetric stochastic entry," Canadian Journal of Economics, Canadian Economics Association, vol. 49(1), pages 52-75, February.
- Çağıl Koçyiğit & Halil I. Bayrak & Mustafa Ç. Pınar, 2018. "Robust auction design under multiple priors by linear and integer programming," Annals of Operations Research, Springer, vol. 260(1), pages 233-253, January.
- 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.
- Laurence Ales & Soo-Haeng Cho & Ersin Körpeoğlu, 2017. "Optimal Award Scheme in Innovation Tournaments," Operations Research, INFORMS, vol. 65(3), pages 693-702, June.
- Zhen Li & Ching-Chung Kuo, 2013. "Design of discrete Dutch auctions with an uncertain number of bidders," Annals of Operations Research, Springer, vol. 211(1), pages 255-272, December.
- Milgrom, Paul & Weber, Robert J., 1982.
"The value of information in a sealed-bid auction,"
Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 105-114, June.
- Paul Milgrom & Robert J. Weber, 1981. "The Value of Information in a Sealed-Bid Auction," Discussion Papers 462, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Chen, Bo & Ma, Lijun & Zhu, Zhaobo & Zhou, Yu, 2020. "Disclosure policies in all-pay auctions with bid caps and stochastic entry," Economics Letters, Elsevier, vol. 186(C).
- Christian Terwiesch & Yi Xu, 2008. "Innovation Contests, Open Innovation, and Multiagent Problem Solving," Management Science, INFORMS, vol. 54(9), pages 1529-1543, September.
- Fu, Qiang & Wu, Zenan, 2020. "On the optimal design of biased contests," Theoretical Economics, Econometric Society, vol. 15(4), November.
- Feng, Xin & Lu, Jingfeng, 2016. "The optimal disclosure policy in contests with stochastic entry: A Bayesian persuasion perspective," Economics Letters, Elsevier, vol. 147(C), pages 103-107.
- Segev, Ella, 2020. "Crowdsourcing contests," European Journal of Operational Research, Elsevier, vol. 281(2), pages 241-255.
- Warneryd, Karl, 2003.
"Information in conflicts,"
Journal of Economic Theory, Elsevier, vol. 110(1), pages 121-136, May.
- Wärneryd, Karl, 2000. "Information in Conflicts," SSE/EFI Working Paper Series in Economics and Finance 388, Stockholm School of Economics.
- Wärneryd, Karl, 2001. "Information in conflicts [Information in Konflikten]," Discussion Papers, Research Unit: Market Processes and Governance FS IV 01-11, WZB Berlin Social Science Center.
- Lim, Wooyoung & Matros, Alexander, 2009. "Contests with a stochastic number of players," Games and Economic Behavior, Elsevier, vol. 67(2), pages 584-597, November.
- Chen, Bo & Jiang, Xiandeng & Knyazev, Dmitriy, 2017. "On disclosure policies in all-pay auctions with stochastic entry," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 66-73.
- Ersin Körpeoğlu & Soo-Haeng Cho, 2018. "Incentives in Contests with Heterogeneous Solvers," Management Science, INFORMS, vol. 64(6), pages 2709-2715, June.
- Chawla, Shuchi & Hartline, Jason D. & Sivan, Balasubramanian, 2019. "Optimal crowdsourcing contests," Games and Economic Behavior, Elsevier, vol. 113(C), pages 80-96.
- Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chen, Bo, 2020. "Disclosure policies in research contests with stochastic entry," Economics Letters, Elsevier, vol. 191(C).
- Chen, Bo & Serena, Marco, 2023. "Disclosure Policies in All-Pay Auctions with Bid Caps," Journal of Economic Behavior & Organization, Elsevier, vol. 209(C), pages 141-160.
- Bo Chen & Marco Serena, 2020. "Bid Caps and Disclosure Policies," Working Papers tax-mpg-rps-2020-08, Max Planck Institute for Tax Law and Public Finance.
- Christian Ewerhart & Julia Lareida, 2018. "Voluntary disclosure in asymmetric contests," ECON - Working Papers 279, Department of Economics - University of Zurich, revised Jul 2023.
- Goutham Takasi & Milind Dawande & Ganesh Janakiraman, 2023. "Optimal cardinal contests," Production and Operations Management, Production and Operations Management Society, vol. 32(11), pages 3433-3451, November.
- Chen, Bo & Ma, Lijun & Zhu, Zhaobo & Zhou, Yu, 2020. "Disclosure policies in all-pay auctions with bid caps and stochastic entry," Economics Letters, Elsevier, vol. 186(C).
- Chen, Bo & Serena, Marco & Wang, Zijia, 2024. "Disclosure policies in all-pay auctions with affiliated values," Economic Modelling, Elsevier, vol. 141(C).
- Bo Chen & Emilios Galariotis & Lijun Ma & Zijia Wang & Zhaobo Zhu, 2023. "On disclosure of participation in innovation contests: a dominance result," Post-Print hal-04185528, HAL.
- Hou, Ting & Zhang, Wen, 2021. "Optimal two-stage elimination contests for crowdsourcing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
- Xiaotie Deng & Yotam Gafni & Ron Lavi & Tao Lin & Hongyi Ling, 2021. "From Monopoly to Competition: Optimal Contests Prevail," Papers 2107.13363, arXiv.org.
- Chen, Zhuoqiong, 2021. "Optimal information exchange in contests," Journal of Mathematical Economics, Elsevier, vol. 96(C).
- Liu, Bin & Lu, Jingfeng, 2019. "The optimal allocation of prizes in contests with costly entry," International Journal of Industrial Organization, Elsevier, vol. 66(C), pages 137-161.
- Jiao, Qian & Ke, Changxia & Liu, Yang, 2022. "When to disclose the number of contestants: Theory and experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 193(C), pages 146-160.
- Jürgen Mihm & Jochen Schlapp, 2019. "Sourcing Innovation: On Feedback in Contests," Management Science, INFORMS, vol. 65(2), pages 559-576, February.
- Lakshminarayana Nittala & Sanjiv Erat & Vish Krishnan, 2022. "Designing internal innovation contests," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 1963-1976, May.
- Pin Gao & Xiaoshuai Fan & Yangguang Huang & Ying-Ju Chen, 2022. "Resource Allocation Among Competing Innovators," Management Science, INFORMS, vol. 68(8), pages 6059-6074, August.
- Dmitry Ryvkin & Mikhail Drugov, 2017. "Tournaments," Working Papers wp2017_03_02, Department of Economics, Florida State University.
- Drugov, Mikhail & Ryvkin, Dmitry, 2020.
"Tournament rewards and heavy tails,"
Journal of Economic Theory, Elsevier, vol. 190(C).
- Mikhail Drugov & Dmitry Ryvkin, 2017. "Tournament rewards and heavy tails," Working Papers wp2017_05_01, Department of Economics, Florida State University, revised Sep 2018.
- Mikhail Drugov & Dmitry Ryvkin, 2018. "Tournament Rewards and Heavy Tails," Working Papers w0250, Center for Economic and Financial Research (CEFIR).
- Mikhail Drugov & Dmitry Ryvkin, 2018. "Tournament Rewards and Heavy Tails," Working Papers w0250, New Economic School (NES).
- Naudé, Wim & Bray, Amy & Lee, Celina, 2021. "Crowdsourcing Artificial Intelligence in Africa: Findings from a Machine Learning Contest," IZA Discussion Papers 14545, Institute of Labor Economics (IZA).
- Luke Boosey & Philip Brookins & Dmitry Ryvkin, 2020. "Information Disclosure in Contests with Endogenous Entry: An Experiment," Management Science, INFORMS, vol. 66(11), pages 5128-5150, November.
More about this item
Keywords
Auctions/bidding; Contest; Crowdsourcing; Stochastic entry; Disclosure;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:328:y:2023:i:2:d:10.1007_s10479-023-05416-0. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.