Games 2010, 1(2), 66-88; doi:10.3390/g1020066
Article

The Recursive Core for Non-Superadditive Games

Received: 23 January 2010; in revised form: 2 April 2010 / Accepted: 8 April 2010 / Published: 15 April 2010
(This article belongs to the Special Issue Coalition Formation)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: We study the recursive core introduced in Huang and Sjöström [8]. In general partition function form games, the recursive core coalition structure may be either coarser or finer than the one that maximizes the social surplus. Moreover, the recursive core structure is typically different from the one predicted by the α-core. We fully implement the recursive core for general games, including non-superadditive games where the grand coalition does not form in equilibrium. We do not put any restrictions, such as stationarity, on strategies.
Keywords: coalition formation; non-cooperative implementation; partition function; recursive core
PDF Full-text Download PDF Full-Text [311 KB, uploaded 15 April 2010 10:18 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

Huang, C.-Y.; Sjöström, T. The Recursive Core for Non-Superadditive Games. Games 2010, 1, 66-88.

AMA Style

Huang C-Y, Sjöström T. The Recursive Core for Non-Superadditive Games. Games. 2010; 1(2):66-88.

Chicago/Turabian Style

Huang, Chen-Ying; Sjöström, Tomas. 2010. "The Recursive Core for Non-Superadditive Games." Games 1, no. 2: 66-88.

Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert