Complexity of Computing the Shapley Value in Partition Function Form Games

被引：0
|
作者：
Skibski, Oskar [1 ]
机构：
[1] Univ Warsaw, Inst Informat, PL-02097 Warsaw, Poland
来源：
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH | 2023年 / 77卷
关键词：
COALITION STRUCTURE GENERATION; POWER INDEXES; EXTERNALITIES; CONNECTIVITY; CORE;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We study the complexity of computing the Shapley value in partition function form games. We focus on two representations based on marginal contribution nets (embedded MC-nets and weighted MC-nets) and five extensions of the Shapley value. 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.
引用
收藏
页码：1237 / 1274
页数：38
相关论文
共 50 条
  • [31] Efficiency and the core in NTU games in partition function form
    Bimonte, Giovanna
    Senatore, Luigi
    Tramontano, Salvatore
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [32] Implementation of the recursive core for partition function form games
    Huang, Chen-Ying
    Sjostrom, Tomas
    JOURNAL OF MATHEMATICAL ECONOMICS, 2006, 42 (06) : 771 - 793
  • [33] The Shapley value for bicooperative games
    J. M. Bilbao
    J. R. Fernández
    N. Jiménez
    J. J. López
    Annals of Operations Research, 2008, 158 : 99 - 115
  • [34] Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities
    Oskar Skibski
    Tomasz P. Michalak
    Yuko Sakurai
    Michael Wooldridge
    Makoto Yokoo
    Autonomous Agents and Multi-Agent Systems, 2020, 34
  • [35] The Shapley value for bicooperative games
    Bilbao, J. M.
    Fernandez, J. R.
    Jimenez, N.
    Lopez, J. J.
    ANNALS OF OPERATIONS RESEARCH, 2008, 158 (01) : 99 - 115
  • [36] On the Shapley value of liability games
    Csoka, Peter
    Illes, Ferenc
    Solymosi, Tamas
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (01) : 378 - 386
  • [37] Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities
    Skibski, Oskar
    Michalak, Tomasz P.
    Sakurai, Yuko
    Wooldridge, Michael
    Yokoo, Makoto
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2020, 34 (01)
  • [38] Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value
    Greco, Gianluigi
    Lupia, Francesco
    Scarcello, Francesco
    ARTIFICIAL INTELLIGENCE, 2020, 278
  • [39] Efficiently computing the Shapley value of connectivity games in low-treewidth graphs
    van der Zanden, Tom C.
    Bodlaender, Hans L.
    Hamers, Herbert J. M.
    OPERATIONAL RESEARCH, 2023, 23 (01)
  • [40] Efficiently computing the Shapley value of connectivity games in low-treewidth graphs
    Tom C. van der Zanden
    Hans L. Bodlaender
    Herbert J. M. Hamers
    Operational Research, 2023, 23
12345