•  
  •  
 

Turkish Journal of Mathematics

DOI

10.3906/mat-1404-56

Abstract

We define a decomposition of transferable utility games based on shifting the worth of the grand coalition so that the associated game has a nonempty core. We classify the set of all transferable utility games based on that decomposition and analyze their structure. Using the decomposition and the notion of minimal balanced collections, we give a set of necessary and sufficient conditions for a transferable utility game to have a singleton core.

First Page

200

Last Page

211

Included in

Mathematics Commons

Share

COinS