Essential Players in Cooperative Games with Graph Communication Structure
From MaRDI portal
Recommendations
- Games on fuzzy communication structures with Choquet players
- Values for cooperative games over graphs and games with inadmissible coalitions
- Communication and its cost in graph-restricted games
- scientific article; zbMATH DE number 5823886
- The Myerson value for cooperative games on communication structure with fuzzy coalition
Cites work
- Adaptive allocation rules for hypergraph games
- Allocation rules for hypergraph communication situations
- An axiomatization of the disjunctive permission value for games with a permission structure
- Characterizations of the position value for hypergraph communication situations
- Communication situations with asymmetric players.
- Component-wise proportional solutions for communication graph games
- Conference structures and fair allocation rules
- Cooperative games with coalition structures
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- On the Position Value for Communication Situations
- The average tree permission value for games with a permission tree
- 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
- The degree value for games with communication structure
- The Myerson value for union stable structures
- The position value for union stable systems
This page was built for publication: Essential Players in Cooperative Games with Graph Communication Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495224)
