Computing cooperative solution concepts in coalitional skill games
type: Item
instance of: scholarly article
title: Computing cooperative solution concepts in coalitional skill games
zbMATH Open document ID: 1334.91007
author: Yoram Bachrach
author: David C. Parkes
author: Jeffrey S. Rosenschein
published in: Artificial Intelligence
publication date: 2015-08-27T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6476302
zbMATH Keywords: coalitional game theory
zbMATH Keywords: core
zbMATH Keywords: power indices
describes a project that uses: SNAP
MaRDI profile type: Publication
full work available at URL: j.artint.2013.07.005
OpenAlex ID: W2153757941
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Power Indices in Spanning Connectivity Games
cites work: The Least-Core of Threshold Network Flow Games
cites work: The Cost of Stability in Coalitional Games
cites work: Q2715704
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: Q4506459
cites work: Q4420529
cites work: Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
cites work: On the Complexity of Cooperative Solution Concepts
cites work: Q4633840
cites work: The Complexity of Power-Index Comparison
cites work: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: Q5817872
cites work: Geometric algorithms and combinatorial optimization
cites work: Exact algorithms and applications for tree-like Weighted Set Cover
cites work: NP-completeness for calculating power indices of weighted majority games
cites work: Multilinear extensions and the banzhaf value
cites work: On the core of linear production games
cites work: The Cost of Stability in Network Flow Games
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: The Nucleolus of a Characteristic Function Game
cites work: Q3818127
cites work: Q5817870
cites work: Quasi-Cores in a Monetary Economy with Nonconvex Preferences
cites work: Methods for task allocation via agent coalition formation
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: The complexity of counting in sparse, regular, and planar graphs
cites work: On the computational complexity of coalitional resource games
DOI: 10.1016/J.ARTINT.2013.07.005
description: scientific article; zbMATH DE number 6476302