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

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

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.

Cooperative games model situations where the actors can collaborate, can form coalitions. There exist many static models, however models are too simplistic compared to our more complex world. Despite the fact that there have been several experimental studies on coalition formation there are only...

The two most fundamental questions in cooperative game theory are: When a game is played, what coalitions will be formed and what payoff vectors will be chosen? No previous solution concepts or theories in the literature provide satisfactory answers to both questions; answers are especially...

The Shapley value of a cooperative transferable utility game distributes the dividendof each coalition in the game equally among its members. Given exogenous weightsfor all players, the corresponding weighted Shapley value distributes the dividendsproportionally to their weights. In this...

We study a particular class of cost sharing games – "data games" – covering situations wheresome players own data which are useful for a project pursued by the set of all players. Theproblem is to set up compensations between players. Data games are subadditive butgenerally not concave, and...

Ordinarily, the process of decision making by a committee through voting is mod-elled by a monotonic game the range of whose characteristic function is restricted tof0; 1g: The decision rule that governs the collective action of a voting body induces ahierarchy in the set of players in terms of...