The average tree value for hypergraph games
From MaRDI portal
Publication:2074839
DOI10.1007/s00186-021-00762-wzbMath1483.91023OpenAlexW4206463452MaRDI QIDQ2074839
Guang Zhang, Erfang Shan, Anna B. Khmelnitskaya, Li-ying Kang, Adolphus J. J. Talman
Publication date: 11 February 2022
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/331f101b-09ee-47d6-afdf-eccae8767583
Related Items (2)
Tree solutions and standardness for cycle-free graph games ⋮ The two-step average tree value for graph and hypergraph games
Cites Work
- Unnamed Item
- Efficiency and collusion neutrality in cooperative games and networks
- A characterization of the average tree solution for tree games
- Conference structures and fair allocation rules
- Allocation rules for hypergraph communication situations
- The Myerson value for union stable structures
- The average tree solution for cooperative games with communication structure
- Solution concepts for games with general coalitional structure
- Equivalence and axiomatization of solutions for cooperative games with circular communication structure
- The average tree solution for cycle-free graph games
- Values of Graph-Restricted Games
- On the Position Value for Communication Situations
- Graphs and Cooperation in Games
This page was built for publication: The average tree value for hypergraph games