We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...

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

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 to every TU-game. In the literature various models of games...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

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

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 vectors to every TU-game. Some solutions that are based on distributing...

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. To understand these applications better, economic theory studies the similarities and differences between them. The purpose of this paper is to investigate a special class of cooperative...

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

Many economic and social situations can be represented by a digraph. Both axiomatic and iterative methods to determine the strength or power of all the nodes in a digraph have been proposed in the literature. We propose a new method, where the power of a node is determined by both the number of...