Recursive Sequences Identifying The Number Of Embedded Coalitions
Strategic behaviors of players depend crucially on the coalition structures of a game. A recursive sequence identifying the number of embedded coalitions in a n-player game is derived. The paper also derives a recursive sequence identifying the number of embedded coalitions in a n-player game where the position of the individual player in a partition counts.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 10 (2008)
Issue (Month): 01 ()
|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:10:y:2008:i:01:p:129-136. 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.