相关论文: Complexity of Computing the Shapley Value in Games…

In this research, we discuss a problem of calculating the Shapley value in bankruptcy games. We show that the decision problem of computing the Shapley value in bankruptcy games is NP-complete. We also investigate the relationship between…

Suppose that $n$ computer devices are to be connected to a network via inhomogeneous Bernoulli trials. The Shapley value of a device quantifies how much the network's value increases due to the participation of that device. Characteristic…

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…

In this research, we address the problem of computing the Shapley value in minimum-cost spanning tree (MCST) games. We introduce the saving game as a key framework for approximating the Shapley value. By reformulating MCST games into their…

The Shapley value is a game-theoretic notion for wealth distribution that is nowadays extensively used to explain complex data-intensive computation, for instance, in network analysis or machine learning. Recent theoretical works show that…

The problem of explaining the behavior of deep neural networks has recently gained a lot of attention. While several attribution methods have been proposed, most come without strong theoretical foundations, which raises questions about…

We show that any cooperative game can be represented by an assignment of costly facilities to players, in which it is intuitively obvious how to allocate the total cost in an equitable manner. This equitable solution turns out to be the…

We consider fair and consistent extensions of the Shapley value for games with externalities. Based on the restriction identified by Casajus et al. (2024, Games Econ. Behavior 147, 88-146), we define balanced contributions, Sobolev's…

This paper introduces a measure of uncertainty in the determination of the Shapley value, illustrates it with examples, and studies some of its properties. The introduced measure of uncertainty quantifies random variations in a player's…

The Shapley value is one of the most important solution concepts in cooperative game theory. In coalitional games without externalities, it allows to compute a unique payoff division that meets certain desirable fairness axioms. However, in…

We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to…

As the use of complex machine learning models continues to grow, so does the need for reliable explainability methods. One of the most popular methods for model explainability is based on Shapley values. There are two most commonly used…

We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that…

Shapley values have become one of the most popular feature attribution explanation methods. However, most prior work has focused on post-hoc Shapley explanations, which can be computationally demanding due to its exponential time complexity…

The Shapley value is a common tool in game theory to evaluate the importance of a player in a cooperative setting. In a geometric context, it provides a way to measure the contribution of a geometric object in a set towards some function on…

What is the value of an individual model in an ensemble of binary classifiers? We answer this question by introducing a class of transferable utility cooperative games called \textit{ensemble games}. In machine learning ensembles,…

Game-theoretic attribution techniques based on Shapley values are used to interpret black-box machine learning models, but their exact calculation is generally NP-hard, requiring approximation methods for non-trivial models. As the…

We introduce a new Shapley value approach for global sensitivity analysis and machine learning explainability. The method is based on the first-order partial derivatives of the underlying function. The computational complexity of the method…

Shapley values have become one of the go-to methods to explain complex models to end-users. They provide a model agnostic post-hoc explanation with foundations in game theory: what is the worth of a player (in machine learning, a feature…

We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming…