In this paper shortest path games are considered. The transportation of a good in a network has costs and benefit too. The problem is to divide the profit of the transportation among the players. Fragnelli et al (2000) introduce the class of shortest path games, which coincides with the class of...

Few elections attract so much attention as the Papal Conclave that elects the religious leader of over a billion Catholics worldwide. The Conclave is an interesting case of qualified majority voting with many participants and no formal voting blocks. Each cardinal is a well-known public gure...

We suggest new characterizations of the Banzhaf value without the symmetry axiom, which reveal that the characterizations by Lehrer (1988, International Journal of Game Theory 17, 89-99) and Nowak (1997, International Journal of Game Theory 26, 127-141) as well as most of the characterizations...

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.

The concept of fair representation of voters in a committee representing different voters' groups, such as national representations in union of states, is discussed. This concept, introduced into discussion about voting rights in the Council of European Union in 2004, was narrowed to proposal of...

We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that...

In this paper we provide new axiomatizations of the Shapley value for TU-games using axioms that are based on relational aspects in the interactions among players. Some of these relational aspects, in particular the economic or social interest of each player in cooperating with each other, can...

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

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

We generalize the null player property (satisfied by the Shapley value) and nullifying player property (satisfied by the equal division solution) to the so-called delta-reducing player property, stating that a delta-reducing player (being a player such that any coalition containing this player...