This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue.We assume that the agents collaborate in order to achieve an efficient outcome for society.We allow for side-payments and provide a method for obtaining...

This paper introduces the notion of protective equilibrium in the context of fin ite games in strategic form.It shows that for matrix games the set of protective equilibria equals the set of proper equilibria.Moreover, in the context of bima trix games, the notion of protective behaviour is used...

The function that assigns to each matrix game (i.e., the mixed extension of a finite zero-sum two-player game) its value is axiomatized by a number of intuitive properties.

In this paper we consider communication situations in which utility is nontransferable. We compare this model with the more familiar model of transferable utility communication situations and point out an odd feature of the latter. We mainly focus on the inheritance of properties of the...