This survey captures the main contributions in the area described by the title that were published up to 1997. (Unfortunately, it does not capture all of them.) The variations that are the subject of this chapter are those axiomatically characterized solutions which are obtained by varying...

We suppose that players in a cooperative game are located within a graph structure, such as a social network or supply route, that limits coalition formation to coalitions along connected subsets within the graph. This in turn leads to a more general study of coalitional games in which there are...

We study a particular class of cost sharing games - quot;data gamesquot; - covering situations where some players own data which are useful for a project pursued by the set of all players. The problem is to set up compensations between players. Data games are subadditive but generally not...

We propose and characterize weighted-egalitarian values for cooperative transferable utility games. Each weighted-egalitarian value divides the worth of the grand coalition into two parts and allocates them through equality and proportionality based on exogenous player weights. We characterize...

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is...

The Shapley value of a cooperative transferable utility game distributes the dividend of each coalition in the game equally among its members. Given exogenous weights for all players, the corresponding weighted Shapley value distributes the dividends proportionally to their weights. In this...