A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

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

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division solution. In the literature various axiomatizations of these solutions can be found. Axiomatizations of the Shapley value often use efficiency which is not satisfied by the Banzhaf...

In this paper we consider the problem of sharing water from a river among a group of agents (countries, cities, firms) located along the river. The benefit of each agent depends on the amount of water consumed by the agent. An allocation of the water among the agents is efficient when it...

Polluted rivers are harmful to human, animals and plants living along it. To reduce the harm, cleaning costs are generated. However, when the river passes through several different countries or regions, a relevant question is how should the costs be shared among the agents. Ni and Wang (2007)...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

A situation in which a finite set of players can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility. A solution for TU-games assigns to every TU-game a distribution of the payoffs that can be earned over the individual players. Two well-known...

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

A cooperative game with transferable utilities, or simply aTU-game, describes a situation in which players can obtain certainpayoffs by cooperation. A solution mapping for these games is amapping which assigns to every game a set of payoff distributionsover the players in the game. Well-known...

The paper discusses the set of Harsanyi payoff vectors,also known as the Selectope. First, we reconsider some results on Harsanyi payoff vectors, published by Vasil'ev in the late 1970's, within a more general framework. In particular, these results state already that the set of Harsanyi payoff...