×

The optimal disclosure policy in contests with stochastic entry: a Bayesian persuasion perspective. (English) Zbl 1396.91240

Summary: Following a Bayesian persuasion approach, we establish that full disclosure (resp. concealment) is the contest organizer’s effort-maximizing policy for disclosing the number of actual contestants if the characteristic function of the imperfectly discriminatory contest technology is strictly concave (resp. convex).

MSC:

91B26 Auctions, bargaining, bidding and selling, and other market models
91B44 Economics of information
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chan, Jimmy, Li, Fei, Wang, Yun, 2015. Discriminatory Persuasion: How to Convince a Group. Working paper.
[2] Ely, Jeffrey; Frankel, Alexander; Kamenica, Emir, Suspense and surprise, J. Polit. Econ., 123, 1, 215-260, (2015)
[3] Fu, Qiang; Jiao, Qian; Lu, Jingfeng, On disclosure policy in contests with stochastic entry, Public Choice, 148, 3-4, 419-434, (2011)
[4] Kamenica, Emir; Gentzkow, Matthew, Bayesian persuasion, Amer. Econ. Rev., 101, 6, 2590-2615, (2011) · Zbl 1393.91020
[5] Li, Fei, Norman, Peter, 2015. On Bayesian Persuasion with Multiple Senders. Working paper.
[6] Lim, Wooyoung; Matros, Alexander, Contests with a stochastic number of players, Games Econom. Behav., 67, 2, 584-597, (2009) · Zbl 1188.91016
[7] McAfee, Preston; McMillan, John, Auctions with a stochastic number of bidders, J. Econom. Theory, 43, 1, 1-19, (1987) · Zbl 0624.90003
[8] Wang, Yun, 2012. Bayesian Persuasion with Multiple Receivers. Working paper.
[9] Zhang, Jun; Zhou, Junjie, Information disclosure in contests: a Bayesian persuasion approach, Econom. J., (2015), (forthcoming)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.