Cooperative games with bounded dependency degree

Conference item

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational problems associated with many of these solution concepts tend to be intractable---NP-hard or worse. In this paper, we incorporate complexity measures recently proposed by Feige and Izsak (2013), called dependency degree and supermodular degree, into the complexity analysis of coopera- tive games. We show that many computational problems for cooperative games become tractable for games whose dependency degree or supermodular degree are bounded. In particular, we prove that simple games admit efficient algorithms for various solution concepts when the supermodular degree is small; further, we show that computing the Shapley value is always in FPT with respect to the dependency degree. Finally, we observe that, while determining the dependency among players is computationally hard, there are efficient algorithms for special classes of games.

Authors: Igarashi, A; Izsak, R; Elkind, E

• Publication status: Published
• Peer review status: Reviewed (other)
• Publisher: Association for the Advancement of Artificial Intelligence Publications
• Host title: Thirty-Second AAAI Conference on Artificial Intelligence
• Journal: Thirty-Second AAAI Conference on Artificial Intelligence
• Pages: 1063-1070
• Publication date: 2018-04-25
• Acceptance date: 2017-12-01
• Event location: New Orleans, Louisiana USA
• EISSN: 2374-3468
• ISBN: 9781577358008