Group contests with private information and the Weakest Link

• 成果类型: Article
• 署名作者: Barbieri, Stefano; Kovenock, Dan; Malueg, David A.; Topolyan, Iryna
• 署名单位: Tulane University; Chapman University System; Chapman University; University of California System; University of California Riverside; University System of Ohio; University of Cincinnati
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2019.09.008
• 发表日期: 2019
• 页码: 382-411
• 关键词: All-pay auction; groups; Bayes-Nash equilibrium; Weakest link; incomplete information; COORDINATION

摘要

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. (C) 2019 Elsevier Inc. All rights reserved.