Group contests with private information and the "Weakest Link"

被引:5
|
作者
Barbieri, Stefano [1 ]
Kovenock, Dan [2 ]
Malueg, David A. [3 ]
Topolyan, Iryna [4 ]
机构
[1] Tulane Univ, Dept Econ, 206 Tilton Hall, New Orleans, LA 70118 USA
[2] Chapman Univ, Econ Sci Inst, One Univ Dr, Orange, CA 92866 USA
[3] Univ Calif Riverside, Dept Econ, 3136 Sproul Hall, Riverside, CA 92521 USA
[4] Univ Cincinnati, Dept Econ, 2906 Woodside Dr, Cincinnati, OH 45221 USA
关键词
All-pay auction; Groups; Bayes-Nash equilibrium; Weakest link; Incomplete information; Coordination; ALL-PAY AUCTIONS; INCOMPLETE INFORMATION; SHOT;
D O I
10.1016/j.geb.2019.09.008
中图分类号
F [经济];
学科分类号
02 ;
摘要
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.
引用
收藏
页码:382 / 411
页数:30
相关论文
共 50 条