A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable...

In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are...

We consider the problem of ranking sets of objects, the members of which are mutually compatible. Assuming that each object is either good or bad, we axiomatically characterize a cardinality-based rule which arises naturally in this dichotomous setting.

In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are...

This paper discusses minimum cost spanning tree games and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each agent's decision whether or not to...