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

By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

In this paper we study cooperative cost games arising from domination problems on graphs.We introduce three games to model the cost allocation problem and we derive a necessary and su cient condition for the balancedness of all three games.Furthermore we study concavity of these games.

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class...

AMS classification: 90D12;

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...