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

AMS classifications: 90D12, 90C05, 90C34.

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

In this note we introduce an egalitarian solution, called the dual egalitarian solution, that is the natural counterpart of the egalitarian solution of Dutta and Ray (1989).We prove, among others, that for a convex game the egalitarian solution coincides with the dual egalitarian solution for...

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs.It is shown that these sequencing games are convex.

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 consider information collecting (IC) situations where an action taker in an uncertain situation can improve his action choices by gathering information from some players who are more informed about the situation. Then the problem of sharing the gains when cooperating with...

The problem of financing a set of public goods (facilities, projects) by private contri- butions is studied. The corresponding cooperative game, the realization game, is shown to be convex. For the noncooperative setting we study a realization scheme that induces a strategic game. This...

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.