We consider a two-group contest game with weakest-link social composition functions and convex cost functions and prove the existence of a unique group-proof Nash equilibrium. Such a refinement of the Nash equilibrium prescribes the same communication possibilities as those required by a coalition-proof Nash equilibrium—in the precise sense of Bernheim et al. (J Econ Theory 42:1–12, 1987)—only among the contenders of the same group and between the two groups. We show how a fictitious game with “most inefficient fictitious contenders” can be constructed to prove the existence of a unique group-proof Nash equilibrium of the original two-group contest game. An example evidences that cautious arguments on the (twice) differentiability of cost functions must be used in such a construction.
Two-group contests with communication within and between groups / Federico Quartieri; Ryusuke Shinohara. - ELETTRONICO. - (2016), pp. 245-268. [10.1007/978-3-319-29254-0_15]
Two-group contests with communication within and between groups
Federico Quartieri;
2016
Abstract
We consider a two-group contest game with weakest-link social composition functions and convex cost functions and prove the existence of a unique group-proof Nash equilibrium. Such a refinement of the Nash equilibrium prescribes the same communication possibilities as those required by a coalition-proof Nash equilibrium—in the precise sense of Bernheim et al. (J Econ Theory 42:1–12, 1987)—only among the contenders of the same group and between the two groups. We show how a fictitious game with “most inefficient fictitious contenders” can be constructed to prove the existence of a unique group-proof Nash equilibrium of the original two-group contest game. An example evidences that cautious arguments on the (twice) differentiability of cost functions must be used in such a construction.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
