Allocation rules for communication situations with incompatibilities
From MaRDI portal
Recommendations
- Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution
- scientific article; zbMATH DE number 36707
- Cooperation when some players are incompatible
- Allocation rules for hypergraph communication situations
- Cost allocation and communication
Cites work
- Allocation rules for network games
- Conference structures and fair allocation rules
- Cooperation when some players are incompatible
- Efficient extensions of the Myerson value
- Games on signed graphs
- Graphs and Cooperation in Games
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1090983 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Marginality and Myerson values
- Measuring power in coalitional games with friends, enemies and allies
- Myerson values for games with fuzzy communication structure
- Signed graphs
- Social and economic networks.
- The Myerson value for cooperative games on communication structure with fuzzy coalition
- The Myerson value for directed graph games
- Values of games with probabilistic graphs
This page was built for publication: Allocation rules for communication situations with incompatibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638851)
