AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
From MaRDI portal
Publication:5505735
DOI10.15807/jorsj.51.203zbMath1154.91361OpenAlexW1547764494MaRDI QIDQ5505735
Yoshitsugu Yamamoto, Adolphus J. J. 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
Related Items (5)
Parameterized fairness axioms on cycle-free graph games ⋮ A strategic implementation of the average tree solution for cycle-free graph games ⋮ The average tree solution for cooperative games with communication structure ⋮ Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions ⋮ A Simple Bargaining Procedure for the Myerson Value
This page was built for publication: AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES