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 n-Person games. In: Kuhn H, Tucker A (eds) Contributions to the theory of games II. Princeton Universi...

We investigate the distribution of the well-studied Shapley–Shubik values in weighted voting games where the agents are stochastically determined. The Shapley-Shubik value measures the voting power of an agent, in typical collective decision making systems. While easy to estimate empirically given the parameters of a weighted voting game, the Shapley values are notoriously hard to reason about ...

The Shapley value provides a fair method for the division of value in coalitional games. Motivated by the application of crowdsourcing for the collection of suitable labels and features for regression and classification tasks, we develop a method to approximate the Shapley value by identifying a suitable decomposition into multiple issues, with the decomposition computed by applying a graph par...

The Shapley value (SV) is a fair and principled metric for contribution evaluation in cross-silo federated learning (cross-silo FL), wherein organizations, i.e., clients, collaboratively train prediction models with the coordination of parameter server. However, existing SV calculation methods FL assume that server can access raw public test data. This may not be valid assumption practice consi...

This article describes the basic elements of the cooperative approach to game theory, one of the two counterparts of the discipline. After the presentation of some basic definitions, the focus will be on the core and the Shapley value, two of the most central solution concepts in cooperative game theory. JEL classification: C7.

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performan...