Computational complexity of a solution for directed graph cooperative games

DOI10.1007/S40305-013-0025-8MaRDI QIDQ384201zbMATH OpenOpenAlexFDO

Authors Ayumi Igarashi, Yoshitsugu Yamamoto

Publication date 27 November 2013

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-013-0025-8

zbMATH Keywords

linear extensioncoalition\(\#P\)-completeaverage covering tree valuecommunication structuredigraph game

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The average covering tree value for directed graph games
• On the Complexity of Cooperative Solution Concepts
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• The average tree solution for cycle-free graph games
• ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Counting linear extensions
• Graph theory
• On the Complexity of Cooperative Solution Concepts
• The Shapley value for cooperative games under precedence constraints

Cited in

(3)

• Goal-directed Unbounded Coalitional Game and Its Complexity
• Strategically supported cooperation in dynamic games with coalition structures
• Cooperation in two-stage games on undirected networks

This page was built for publication: Computational complexity of a solution for directed graph cooperative games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384201)