Coalition-Proof Nash Equilibria In A Normal-Form Game And Its Subgames
The relationship between coalition-proof (Nash) equilibria in a normal-form game and those in its subgame is examined. A subgame of a normal-form game is a game in which the strategy sets of all players in the subgame are subsets of those in the normal-form game. In this paper, focusing on a class of aggregative games, we provide a sufficient condition for the aggregative game under which every coalition-proof equilibrium in a subgame is also coalition-proof in the original normal-form game. The stringency of the sufficient condition means that a coalition-proof equilibrium in a subgame is rarely a coalition-proof equilibrium in the whole game.
Volume (Year): 12 (2010)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:12:y:2010:i:03:p:253-261. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.