Values for games with two-level communication structures

DOI10.1016/j.dam.2013.10.019zbMath1285.91009OpenAlexW1998759845MaRDI QIDQ2636826

Anna B. Khmelnitskaya

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.019

zbMATH Keywords

TU gamecoalition structureMyerson valueOwen valuecommunication structureAumann-Drèze valuecomponent efficiencydeletion link property

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items

Component-wise proportional solutions for communication graph games ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Efficient extensions of communication values ⋮ An Owen-type value for games with two-level communication structure ⋮ Two efficient values of cooperative games with graph structure based on \(\tau\)-values ⋮ Two-step values for games with two-level communication structure ⋮ Constructive and blocking power in collaborative transportation ⋮ Values for transferable utility games with coalition and graph structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Values for rooted-tree and sink-tree digraph games and sharing a river
• Cooperative games with coalition structures
• Sharing a river.
• The Owen value applied to games with graph-restricted communication
• Component efficient solutions in line-graph games with applications
• The average tree solution for cycle-free graph games
• A characterization of the position value
• A TWO-STEP SHAPLEY VALUE FOR COOPERATIVE GAMES WITH COALITION STRUCTURES
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games