Complexity of Computing the Shapley Value in Games with Externalities
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.
How to Cite
Skibski, O. (2020). Complexity of Computing the Shapley Value in Games with Externalities. Proceedings of the AAAI Conference on Artificial Intelligence, 34(02), 2244-2251. https://doi.org/10.1609/aaai.v34i02.5601
AAAI Technical Track: Game Theory and Economic Paradigms