Complexity of computing the Shapley value in partition function form games

DOI10.1613/JAIR.1.14648MaRDI QIDQ6488801zbMATH OpenFDO

Authors Oskar Skibski

Publication date 23 October 2023

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/JAIR.1.14648

zbMATH Keywords

game theorymultiagent systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cooperative games (91A12)

Recommendations

• Computing the Shapley value of threshold cardinality matching games
• Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
• Shapley meets Shapley
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• Computing Shapley Value in Supermodular Coalitional Games

Cites work

• A characterization of the Bell numbers
• A set of axioms for a value for partition function games
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• Attachment centrality: measure for connectivity in networks
• Coalition structure generation with worst case guarantees
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
• Complexity of constructing solutions in the core based on synergies among coalitions
• Computational Aspects of Cooperative Game Theory
• Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
• Determinants of matrices related to the Pascal triangle
• Efficient computation of the Shapley value for game-theoretic network centrality
• Fair division in the presence of externalities
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 1766750 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Manipulating the quota in weighted voting games
• Marginal Contributions and Externalities in the Value
• Measuring power in coalitional games with friends, enemies and allies
• NP-completeness of some problems concerning voting games
• On the Complexity of Cooperative Solution Concepts
• On the complexity of core, kernel, and bargaining set
• On the computational complexity of the Jones and Tutte polynomials
• On the computational complexity of weighted voting games
• Power Indices in Spanning Connectivity Games
• Sharing the surplus: An extension of the Shapley value for environments with externalities
• The r-Bell numbers
• The Complexity of Enumeration and Reliability Problems
• The extended and generalized Shapley value: Simultaneous consideration of coalitional externalities and coalitional structure
• THE SHAPLEY VALUE FOR PARTITION FUNCTION FORM GAMES
• The stochastic Shapley value for coalitional games with externalities
• Values of games in partition function form

Cited in

(2)

• scientific article; zbMATH DE number 7559220 (Why is no real title available?)
• The Shapley Value of Tuples in Query Answering.

This page was built for publication: Complexity of computing the Shapley value in partition function form games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488801)