scholarly journals Complexity of Computing the Shapley Value in Games with Externalities

2020 ◽  
Vol 34 (02) ◽  
pp. 2244-2251 ◽  
Author(s):  
Oskar Skibski
Keyword(s):  
Polynomial Time ◽  
Shapley Value ◽  
Marginal Contribution ◽  
The Shapley Value ◽  
Games With Externalities ◽  
Computational Properties

We study the complexity of computing the Shapley value in games with externalities. We focus on two representations based on marginal contribution nets (embedded MC-nets and weighted MC-nets) and five extensions of the Shapley value to games with externalities. Our results show that while weighted MC-nets are more concise than embedded MC-nets, they have slightly worse computational properties when it comes to computing the Shapley value: two out of five extensions can be computed in polynomial time for embedded MC-nets and only one for weighted MC-nets.

A Note on a Class of Solutions for Games with Externalities Generalizing the Shapley Value

2015 ◽  
Vol 17 (03) ◽  
pp. 1550003 ◽  
Author(s):  
Joss Sánchez-Pérez
Keyword(s):  
Partition Function ◽  
Shapley Value ◽  
Complete Characterization ◽  
Function Form ◽  
Characterization Result ◽  
The Shapley Value ◽  
Games With Externalities ◽  
Partition Function Form

In this paper we study a family of extensions of the Shapley value for games in partition function form with n players. In particular, we provide a complete characterization for all linear, symmetric, efficient and null solutions in these environments. Finally, we relate our characterization result with other ways to extend the Shapley value in the literature.

scholarly journals Efficient Computation of Semivalues for Game-Theoretic Network Centrality

2018 ◽  
Vol 63 ◽  
pp. 145-189 ◽  
Author(s):  
Mateusz K. Tarkowski ◽  
Piotr L. Szczepański ◽  
Tomasz P. Michalak ◽  
Paul Harrenstein ◽  
Michael Wooldridge
Keyword(s):  
Polynomial Time ◽  
Shapley Value ◽  
Centrality Measures ◽  
Efficient Computation ◽  
Solution Concepts ◽  
Banzhaf Index ◽  
The Shapley Value ◽  
Game Theoretic ◽  
Theoretic Solution ◽  
Network Centralities

Some game-theoretic solution concepts such as the Shapley value and the Banzhaf index have recently gained popularity as measures of node centrality in networks. While this direction of research is promising, the computational problems that surround it are challenging and have largely been left open. To date there are only a few positive results in the literature, which show that some game-theoretic extensions of degree-, closeness- and betweenness-centrality measures are computable in polynomial time, i.e., without the need to enumerate the exponential number of all possible coalitions. In this article, we show that these results can be extended to a much larger class of centrality measures that are based on a family of solution concepts known as semivalues. The family of semivalues includes, among others, the Shapley value and the Banzhaf index. To this end, we present a generic framework for defining game-theoretic network centralities and prove that all centrality measures that can be expressed in this framework are computable in polynomial time. Using our framework, we present a number of new and polynomial-time computable game-theoretic centrality measures.

Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities

2019 ◽  
Vol 34 (1) ◽  
Author(s):  
Oskar Skibski ◽  
Tomasz P. Michalak ◽  
Yuko Sakurai ◽  
Michael Wooldridge ◽  
Makoto Yokoo
Keyword(s):  
Decision Trees ◽  
Shapley Value ◽  
Efficient Computation ◽  
The Shapley Value ◽  
Games With Externalities

scholarly journals Shapley Value for Parallel Machine Sequencing Situation without Initial Order

2015 ◽  
Vol 2015 ◽  
pp. 1-6
Author(s):  
Shanshan Liu ◽  
Zhaohui Liu
Keyword(s):  
Polynomial Time ◽  
Shapley Value ◽  
Processing Time ◽  
Cost Allocation ◽  
Parallel Machine ◽  
Allocation Rule ◽  
The Shapley Value ◽  
Sequencing Game ◽  
Identical Machine

We consider the parallel identical machine sequencing situation without initial schedule. For the situation with identical job processing time, we design a cost allocation rule which gives the Shapley value of the related sequencing game in polynomial time. For the game with identical job weight, we also present a polynomial time procedure to compute the Shapley value.

scholarly journals The Tractability of the Shapley Value over Bounded Treewidth Matching Games

2017 ◽  
Author(s):  
Gianluigi Greco ◽  
Francesco Lupia ◽  
Francesco Scarcello
Keyword(s):  
Polynomial Time ◽  
Shapley Value ◽  
Open Problem ◽  
Positive Answer ◽  
Coalitional Games ◽  
Solution Concepts ◽  
Bounded Treewidth ◽  
The Shapley Value ◽  
Matching Games

Matching games form a class of coalitional games that attracted much attention in the literature. Indeed, several results are known about the complexity of computing over them {solution concepts}. In particular, it is known that computing the Shapley value is intractable in general, formally #P-hard, and feasible in polynomial time over games defined on trees. In fact, it was an open problem whether or not this tractability result holds over classes of graphs properly including acyclic ones. The main contribution of the paper is to provide a positive answer to this question, by showing that the Shapley value is tractable for matching games defined over graphs having bounded treewidth. The proposed technique has been implemented and tested on classes of graphs having different sizes and treewidth at most three.

scholarly journals Attaining Fairness in Communication for Omniscience

Entropy ◽  
2022 ◽  
Vol 24 (1) ◽  
pp. 109
Author(s):  
Ni Ding ◽  
Parastoo Sadeghi ◽  
David Smith ◽  
Thierry Rakotoarivelo
Keyword(s):  
Polynomial Time ◽  
Shapley Value ◽  
Data Exchange ◽  
Source Coding ◽  
Extreme Points ◽  
Mean Value ◽  
The Core ◽  
Coding Schemes ◽  
The Shapley Value ◽  
Egalitarian Solution

This paper studies how to attain fairness in communication for omniscience that models the multi-terminal compress sensing problem and the coded cooperative data exchange problem where a set of users exchange their observations of a discrete multiple random source to attain omniscience—the state that all users recover the entire source. The optimal rate region containing all source coding rate vectors that achieve omniscience with the minimum sum rate is shown to coincide with the core (the solution set) of a coalitional game. Two game-theoretic fairness solutions are studied: the Shapley value and the egalitarian solution. It is shown that the Shapley value assigns each user the source coding rate measured by their remaining information of the multiple source given the common randomness that is shared by all users, while the egalitarian solution simply distributes the rates as evenly as possible in the core. To avoid the exponentially growing complexity of obtaining the Shapley value, a polynomial-time approximation method is proposed which utilizes the fact that the Shapley value is the mean value over all extreme points in the core. In addition, a steepest descent algorithm is proposed that converges in polynomial time on the fractional egalitarian solution in the core, which can be implemented by network coding schemes. Finally, it is shown that the game can be decomposed into subgames so that both the Shapley value and the egalitarian solution can be obtained within each subgame in a distributed manner with reduced complexity.

Query Games in Databases

2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag
Keyword(s):  
Game Theory ◽  
Cooperative Game ◽  
Shapley Value ◽  
Cooperative Game Theory ◽  
The Shapley Value ◽  
Computational Aspects ◽  
Aggregate Query ◽  
Boolean Query

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.

Sign in / Sign up

Export Citation Format

Share Document