Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities

Michalak , Tomasz, Rahwan, Talal, Marciniak, Dorota , Szamotulski, Marcin and Jennings, Nicholas (2010) Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities. At European Conference on Artificial Intelligence (ECAI), Lisbon, Portugal, , 197-202.


[img] PDF - Version of Record
Download (1355Kb)


Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the value of any coalition is independent of other coalitions in the system. However, externalities play a key role in many real-life situations and have been extensively studied in the game-theoretic and economic literature. In this paper, we consider the issue of computing extensions of the Shapley value to coalitional games with externalities proposed by Myerson [21], Pham Do and Norde [23], and McQuillin [17]. To facilitate efficient computation of these extensions, we propose a new representation for coalitional games with externalities, which is based on weighted logical expressions. We demonstrate that this representation is fully expressive and, sometimes, exponentially more concise than the conventional partition function game model. Furthermore, it allows us to compute the aforementioned extensions of the Shapley value in time linear in the size of the input.

Item Type: Conference or Workshop Item (Speech)
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 271218
Accepted Date and Publication Date:
Date Deposited: 04 Jun 2010 09:44
Last Modified: 31 Mar 2016 14:18
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics