An extension of the Shapley value for games in partition function form is proposed in the paper. We introduce a version of the marginal contributions for environments with externalities. The dummy property related to it is defined. We adapt the system of axioms provided by Shapley (A value for...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

Additive decomposability is an interesting feature of inequality indices which, however, is not always fulfilled; solutions to overcome such an issue have been given by Deutsch and Silber (2007) and by Di Maio and Landoni (2017). In this paper, we apply these methods, based on the “Shapley...

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is...

n agents located along a river generate residues that then require cleaning to return the river to its natural state, which entails some cost. We propose several rules to distribute the total pollutant-cleaning cost among all the agents. We provide axiomatic characterizations using properties...

We consider the problem of how to distribute public expenditure among the different regions of an economic entity after all taxes have been collected. Typical examples are: the regions that make up a country, the states of a federal country, or the countries of a confederation of countries. We...

Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and...