The Recursive Core for Non-Superadditive Games
AbstractWe study the recursive core introduced in Huang and Sjöström . 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Huang, C.-Y.; Sjöström, T. The Recursive Core for Non-Superadditive Games. Games 2010, 1, 66-88.
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.