Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value
Authors:
- Gianluigi GrecoGGGianluigi Greco
- Francesco LupiaFLFrancesco Lupia
- Francesco ScarcelloFSFrancesco Scarcello
- 1 January 2020
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 278
Abstract
No abstract availableKeywords
Funding Information
- Regione Calabria
This publication has 54 references indexed in Scilit:
- On the complexity of core, kernel, and bargaining setArtificial Intelligence, 2011
- Generalized hypertree decompositions: NP-hardness and tractable variantsJournal of the ACM, 2009
- Power in threshold network flow gamesAutonomous Agents and Multi-Agent Systems, 2008
- On the computational complexity of qualitative coalitional gamesArtificial Intelligence, 2004
- Cooperative facility location gamesJournal of Algorithms, 2004
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, 2002
- On the complexity of testing membership in the core of min-cost spanning tree gamesInternational Journal of Game Theory, 1997
- The complexity of computing the tutte polynomial on transversal matroidsCombinatorica, 1995
- NP-completeness of some problems concerning voting gamesInternational Journal of Game Theory, 1990
- The assignment game I: The coreInternational Journal of Game Theory, 1971