Recommendations
Cites work
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 3765567 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- An average lexicographic value for cooperative games
- Average tree solutions and the distribution of Harsanyi dividends
- Component efficient solutions in line-graph games with applications
- Cores of convex games
- Graphs and Cooperation in Games
- Harsanyi power solutions for graph-restricted games
- On hierarchies and communication
- Rooted-tree solutions for tree games
- The Myerson value for union stable structures
- The average tree solution for cooperative games with communication structure
- The average tree solution for cycle-free graph games
- The selectope for cooperative games
Cited in
(6)- Component-wise proportional solutions for communication graph games
- Characterization of the average tree solution and its kernel
- Weighted allocation rules for standard fixed tree games
- The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations
- Weighted component-wise solutions for graph games
- A simple family of solutions for forest games
This page was built for publication: Weighted component fairness for forest games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712475)
