Next Article in Journal
Equity versus Efficiency? Evidence from Three-Person Generosity Experiments
Next Article in Special Issue
Can Justice and Fairness Enlarge International Environmental Agreements?
Previous Article in Journal
(Un)Bounded Rationality in Decision Making and Game Theory – Back to Square One?
Open AccessArticle

The Recursive Core for Non-Superadditive Games

Department of Economics, National Taiwan University, 21 Hsu-Chow Road, Taipei, Taiwan
Department of Economics, Rutgers University, New Brunswick, N.J. 08901, USA
Author to whom correspondence should be addressed.
Games 2010, 1(2), 66-88;
Received: 23 January 2010 / Revised: 2 April 2010 / Accepted: 8 April 2010 / Published: 15 April 2010
(This article belongs to the Special Issue Coalition Formation)
PDF [311 KB, uploaded 15 April 2010]


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. View Full-Text
Keywords: coalition formation; non-cooperative implementation; partition function; recursive core coalition formation; non-cooperative implementation; partition function; recursive core
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top