The two-step average tree value for graph and hypergraph games
From MaRDI portal
Publication:6170573
DOI10.1007/s10479-022-04966-zzbMath1520.91033OpenAlexW3121842566MaRDI QIDQ6170573
Adolphus J. J. Talman, Guang Zhang, Li-ying Kang, Erfang Shan, Anna B. Khmelnitskaya
Publication date: 13 July 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04966-z
Cooperative games (91A12) Hypergraphs (05C65) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Conference structures and fair allocation rules
- Allocation rules for hypergraph communication situations
- The average tree value for hypergraph games
- The average tree solution for cooperative games with communication structure
- The average tree solution for cycle-free graph games
- Graphs and Cooperation in Games
This page was built for publication: The two-step average tree value for graph and hypergraph games