The degree value for games with communication structure
From MaRDI portal
Publication:1621730
DOI10.1007/s00182-018-0631-0zbMath1417.91060OpenAlexW2807643324MaRDI QIDQ1621730
Erfang Shan, Guang Zhang, Xiaokang Shan
Publication date: 9 November 2018
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-018-0631-0
Applications of graph theory (05C90) Cooperative games (91A12) Games involving graphs (91A43) Signaling and communication in game theory (91A28)
Related Items (7)
New Characteristic Function for Cooperative Games with Hypergraph Communication Structure ⋮ Adaptive allocation rules for hypergraph games ⋮ Power surplus solutions for weighted hypergraph communication situations ⋮ A Note on the Position Value for Hypergraph Communication Situations ⋮ The efficient proportional Myerson values ⋮ On the structural stability of values for cooperative games ⋮ The weighted Shapley-egalitarian value for cooperative games with a coalition structure
Cites Work
- Unnamed Item
- Component-wise proportional solutions for communication graph games
- Difference between the position value and the myerson value is due to the existence of coalition structures
- Conference structures and fair allocation rules
- Allocation rules for hypergraph communication situations
- The Myerson value for union stable structures
- The position value for union stable systems
- The position value is the Myerson value, in a sense
- A characterization of the position value
- On the Position Value for Communication Situations
- Graphs and Cooperation in Games
This page was built for publication: The degree value for games with communication structure