AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES

DOI10.15807/JORSJ.51.203MaRDI QIDQ5505735zbMATH OpenOpenAlexFDO

Authors Yoshitsugu Yamamoto, Dolf Talman

Publication date 28 January 2009

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

Full work available at URL https://semanticscholar.org/paper/d689481932ec100771f66b72186cd324335a1767

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• The average tree solution for cycle-free graph games
• The average tree solution for cooperative games with communication structure
• The average tree value for hypergraph games
• The two-step average tree value for graph and hypergraph games
• The average tree solution in graph games with fuzzy coalitions

Cited in

(11)

• The average tree solution for multi-choice forest games
• The average tree solution for cooperative games with communication structure
• The average covering tree value for directed graph games
• A strategic implementation of the average tree solution for cycle-free graph games
• The average tree solution for cycle-free graph games
• A simple bargaining procedure for the Myerson value
• The average tree solution on graph games with interval payoffs
• Thick Subtrees, Games and Experiments
• Parameterized fairness axioms on cycle-free graph games
• Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions
• A characterization of the average tree solution for tree games

This page was built for publication: AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES

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