Discounted tree solutions
From MaRDI portal
Recommendations
Cites work
- A strategic implementation of the average tree solution for cycle-free graph games
- An axiomatization of the Banzhaf value
- Axiomatizations of a class of equal surplus sharing solutions for TU-games
- Bidding for the surplus: a non-cooperative approach to the Shapley value
- Characterization of the average tree solution and its kernel
- Characterizations of weighted and equal division values
- Comparable characterizations of four solutions for permission tree games
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Implementation and axiomatization of discounted Shapley values
- Implementing Efficient Egalitarian Equivalent Allocations
- Null or nullifying players: the difference between the Shapley value and equal division solutions
- On a class of solidarity values
- Potential, Value, and Consistency
- Rooted-tree solutions for tree games
- Sequential sharing rules for river sharing problems
- The average tree permission value for games with a permission tree
- The average tree solution for cycle-free graph games
- The average tree solution for multi-choice forest games
- Tree, web and average web values for cycle-free directed graph games
Cited in
(2)
This page was built for publication: Discounted tree solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505415)