On the complexity of core, kernel, and bargaining set
type: Item
instance of: scholarly article
title: On the complexity of core, kernel, and bargaining set
zbMATH Open document ID: 1233.91018
author: Gianluigi Greco
author: Enrico Malizia
author: Luigi Palopoli
author: Francesco Scarcello
published in: Artificial Intelligence
publication date: 2011-11-25T00:00:00Z
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5980910
zbMATH Keywords: coalitional games
zbMATH Keywords: compact representations
zbMATH Keywords: computational complexity
zbMATH Keywords: solution concepts
zbMATH Keywords: bounded treewidth
MaRDI profile type: Publication
full work available at URL: j.artint.2011.06.002
OpenAlex ID: W2087243523
Wikidata QID: Q57931574
cites work: Reasoning about coalitional games
cites work: Easy problems for tree-decomposable graphs
cites work: Q5341355
cites work: Q4258216
cites work: The Cost of Stability in Coalitional Games
cites work: Power of Natural Semijoins
cites work: Q2715704
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Q4747150
cites work: The complexity of stochastic games
cites work: Complexity of constructing solutions in the core based on synergies among coalitions
cites work: Q4385531
cites work: The kernel of a cooperative game
cites work: Finding nucleolus of flow game
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: On the Complexity of Cooperative Solution Concepts
cites work: Q4482810
cites work: On the computational complexity of weighted voting games
cites work: A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
cites work: Q4633840
cites work: On approximately fair cost allocation in Euclidean TSP games
cites work: On some approximately balanced combinatorial cooperative games
cites work: On the complexity of testing membership in the core of min-cost spanning tree games
cites work: Efficient algorithms for finding maximum matching in graphs
cites work: Q4198056
cites work: Q3254699
cites work: Cooperative facility location games
cites work: Q3457238
cites work: Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
cites work: On the power of structural decompositions of graph-based representations of constraint problems
cites work: Q5547252
cites work: Q4385525
cites work: Finite Rationality and Interpersonal Complexity in Repeated Games
cites work: Totally Balanced Games and Games of Flow
cites work: Matching Games: The Least Core and the Nucleolus
cites work: Cost minimization in wireless networks with a bounded and unbounded number of interfaces
cites work: The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\).
cites work: Q4369424
cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
cites work: Q5655273
cites work: Q5821521
cites work: Traveling salesman games with the Monge property
cites work: Q3576736
cites work: On the core of linear production games
cites work: Q3221403
cites work: Q4217266
cites work: The complexity of facets (and some facets of complexity)
cites work: NP-completeness of some problems concerning voting games
cites work: A note on Helly's theorem
cites work: Graph minors. III. Planar tree-width
cites work: Graph Ramsey theory and the polynomial hierarchy
cites work: The Nucleolus of a Characteristic Function Game
cites work: A taxonomy of complexity classes of functions
cites work: The assignment game. I: The core
cites work: Q5648104
cites work: Permutation games: Another class of totally balanced games
cites work: Coalition Structure Generation over Graphs
cites work: Equilibria, fixed points, and complexity classes

On the complexity of core, kernel, and bargaining set (cites work)
cites work: On the complexity of core, kernel, and bargaining set

On the complexity of core, kernel, and bargaining set (DOI)
DOI: 10.1016/J.ARTINT.2011.06.002