Computational complexity of a solution for directed graph cooperative games

DOI10.1007/s40305-013-0025-8zbMath1276.05075OpenAlexW2156084709MaRDI QIDQ384201

Yoshitsugu Yamamoto, Ayumi Igarashi

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

coalitionlinear extension\(\#P\)-completeaverage covering tree valuecommunication structuredigraph game

Mathematics Subject Classification ID

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

Related Items (2)

Strategically supported cooperation in dynamic games with coalition structures ⋮ Cooperation in two-stage games on undirected networks

Cites Work

• Counting linear extensions
• The Shapley value for cooperative games under precedence constraints
• On the Complexity of Cooperative Solution Concepts
• Unnamed Item
• Unnamed Item

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