Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
type: Item
instance of: scholarly article
title: Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
zbMATH Open document ID: 1254.91020
author: Kazutoshi Ando
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6119213
zbMATH Keywords: Shapley value
zbMATH Keywords: cooperative game
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s13160-012-0078-9
OpenAlex ID: W2035507135
cites work: Computing 2-terminal reliability for radio-broadcast networks
cites work: REDUCTION OF ULTRAMETRIC MINIMUM COST SPANNING TREE GAMES TO COST ALLOCATION GAMES ON ROOTED TREES
cites work: Power Indices in Spanning Connectivity Games
cites work: Determinants of matrices related to the Pascal triangle
cites work: The optimistic \(TU\) game in minimum cost spanning tree problems
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Sharing a minimal cost spanning tree: beyond the folk solution
cites work: Cost monotonicity, consistency and minimum cost spanning tree games
cites work: On the complexity of testing membership in the core of min-cost spanning tree games
cites work: Computing the nucleolus of min-cost spanning tree games is NP-hard.
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q4320535
cites work: Minimum cost spanning tree games
cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: Characterization of the distance between subtrees of a tree by the associated tight span
cites work: Axiomatization of the Shapley value on minimum cost spanning tree games
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Minimum cost spanning tree games and population monotonic allocation schemes.
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Q5817870
DOI: 10.1007/S13160-012-0078-9
description: scientific article; zbMATH DE number 6119213