In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for...

AMS classification: 91A12;

In this paper big boss interval games are introduced and various characterizations are given. The structure of the core of a big boss interval game is explicitly described and plays an important role relative to interval-type bi-monotonic allocation schemes for such games. Specifically, each...

AMS classification: 90D12.

This paper analyzes congestion effects on network situations from a cooperative game theoretic perspective. In network situations players have to connect themselves to a source. Since we consider publicly available networks any group of players is allowed to use the entire network to establish...

AMS classification: 90D12.

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.