In this paper we introduce and analyze the procedural egalitarian solution for transferable utility games. This new concept is based on the result of a coalitional bargaining procedure in which egalitarian considerations play a central role. The procedural egalitarian solution is the first...

A cooperative situation is characterized by a group of players choosing from a set of alternatives, where each alternative results in a joint cost. In this paper we assume that an alternative with minimum total cost will be chosen and we focus on the corresponding cost allocation problem by...

For cooperative games with transferable utility, convexity has turned out to be an important and widely applicable concept. Convexity can be defined in a number of ways, each having its own specific attractions. Basically, these definitions fall into two categories, namely those based on a...

In a deposit game coalitions are formed by players combining their capital. The proceeds of their investments then have to be divided among those players. The current model extends earlier work on capital deposits by allowing reinvestment of returns. Two specific subclasses of deposit games are...

In this paper, we characterize the compromise value of a game as the barycentre of the edges of its core cover. For this, we introduce the value, which extends the adjusted proportional rule for bankruptcy situations and coincides with the compromise value on a large class of games

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 three cardinality-based rules which arise naturally in this dichotomous setting. They are what we call the symmetric...

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...

In this paper we consider a proper Shapley value (the V L value) for cooperative network games. This value turns out to have a nice interpretation. We compute the V L value for various kinds of networks and relate this value to optimal strategies in an associated matrix game

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...