Tree solutions and standardness for cycle-free graph games
From MaRDI portal
Publication:2681825
DOI10.1016/j.econlet.2022.110955zbMath1506.91012OpenAlexW4313379428MaRDI QIDQ2681825
Publication date: 30 January 2023
Published in: Economics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.econlet.2022.110955
Cites Work
- Unnamed Item
- Component-wise proportional solutions for communication graph games
- Rooted-tree solutions for tree games
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
- Egalitarian allocation and players of certain type
- The average tree value for hypergraph games
- Null or nullifying players: the difference between the Shapley value and equal division solutions
- Bidding for surplus in network allocation problems
- The average tree solution for cycle-free graph games
- Graphs and Cooperation in Games
This page was built for publication: Tree solutions and standardness for cycle-free graph games