 Group contests with private information and the “Weakest Link”Stefano Barbieri (), Dan Kovenock, David A. Malueg and Iryna Topolyan Games and Economic Behavior, 2019, vol. 118, issue C, 382-411 Abstract: We study weakest-link group contests with private information. We characterize all pure-strategy Bayes-Nash equilibria: various degrees of coordination are possible, from every cost type choosing a distinct effort level to all cost types coordinating on a single effort level. Such coordination may not enhance welfare. If groups are symmetric except for group size, players in the smaller group bid more aggressively than those in the larger group, but when asymmetries regard multiple dimensions, no clear-cut conclusions are evident. As an additional avenue for cooperation, we investigate cheap-talk sharing of private information among teammates, who then coordinate on the effort level most preferred by the player with the largest announced cost. A single group sharing information does better. But, with respect to the equilibrium in which all types choose a distinct effort, when players of both groups cooperate in this fashion all within-group gains are lost to increased competition between groups. Keywords: All-pay auction; Groups; Bayes-Nash equilibrium; Weakest link; Incomplete information; Coordination (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:118:y:2019:i:c:p:382-411 DOI: 10.1016/j.geb.2019.09.008 Access Statistics for this article Games and Economic Behavior is currently edited by E. Kalai More articles in Games and Economic Behavior from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.