The two-step average tree value for graph and hypergraph games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Allocation rules for hypergraph communication situations
- Conference structures and fair allocation rules
- Graphs and Cooperation in Games
- The average tree solution for cooperative games with communication structure
- The average tree solution for cycle-free graph games
- The average tree value for hypergraph games
Cited in
(11)- The \(cg\)-average tree value for games on cycle-free fuzzy communication structures
- Tree, web and average web values for cycle-free directed graph games
- AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
- The average tree value for hypergraph games
- The average covering tree value for directed graph games
- A characterization of the average tree solution for tree games
- Comparable axiomatizations of the average tree solution and the Myerson value
- The average tree solution for cycle-free graph games
- Tree solutions and standardness for cycle-free graph games
- Value of games with two-layered hypergraphs
- Average tree solutions and the distribution of Harsanyi dividends
This page was built for publication: The two-step average tree value for graph and hypergraph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170573)