Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are nonnegative), and there is some hierarchical...

In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure. In such games the player set is partitioned into unions and...

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...

We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows...

Hamiache (2001) assigns to every TU game a so-called associated game and then shows that the Shapley value is characterized as the unique solution for TU games satisfying the inessential game property, continuity and associated consistency. The latter notion means that for every game the Shapley...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...

Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or...

A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve...