A linear approximation method for the Shapley value
From MaRDI portal
Publication:2389675
DOI10.1016/j.artint.2008.05.003zbMath1184.91029WikidataQ57377393 ScholiaQ57377393MaRDI QIDQ2389675
Shaheen S. Fatima, Michael Wooldridge, Nicholas R. Jennings
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/265802/1/aij08.pdf
68Q25: Analysis of algorithms and problem complexity
91A12: Cooperative games
68W25: Approximation algorithms
Related Items
Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras, The Computational Complexity of Understanding Binary Classifier Decisions, Manipulating the quota in weighted voting games, Variance allocation and Shapley value, Sensitivity indices for independent groups of variables, Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value, Internal structure of coalitions in competitive and altruistic graphical coalitional games, A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games, Variance Reduction for Estimation of Shapley Effects and Adaptation to Unknown Input Distribution
Cites Work
- An algorithm for distributing coalitional value calculations among cooperating agents
- Methods for task allocation via agent coalition formation
- Coalitions among computationally bounded agents
- Computing power indices in weighted multiple majority games.
- Coalition structure generation with worst case guarantees
- Voting power in the European Union enlargement
- On the computational complexity of weighted voting games
- Complexity of constructing solutions in the core based on synergies among coalitions
- Computing Power Indices for Large Voting Games
- On the Complexity of Cooperative Solution Concepts
- Multilinear Extensions of Games
- Generating functions for computing power indices efficiently
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
