Michalak, Tomasz, Rahwan, Talal, Marciniak, Dorota, Szamotulski, Marcin and Jennings, Nicholas
Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
At European Conference on Artificial Intelligence (ECAI), Portugal.
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 , Pham Do and Norde , and McQuillin . 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.
Conference or Workshop Item
|Venue - Dates:
||European Conference on Artificial Intelligence (ECAI), Portugal, 2010-01-01
||Agents, Interactions & Complexity
||04 Jun 2010 09:44
||17 Apr 2017 18:19
|Further Information:||Google Scholar|
Actions (login required)