Complexity of Computing the Shapley Value in Games with Externalities

09/04/2019

∙

by   Oskar Skibski, et al.

∙

0

∙

share

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). 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.