Component-wise proportional solutions for communication graph games

DOI10.1016/j.mathsocsci.2016.03.004zbMath1347.91038OpenAlexW2297549731MaRDI QIDQ277301

Yanxia Dong, Erfang Shan, Guang Zhang

Publication date: 4 May 2016

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2016.03.004

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (7)

The degree value for games with communication structure ⋮ Cost sharing on prices for games on graphs ⋮ Tree solutions and standardness for cycle-free graph games ⋮ The Myerson value for directed graph games ⋮ The efficient proportional Myerson values ⋮ Weighted component-wise solutions for graph games ⋮ The Myerson value on local structures of coalitions

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted component fairness for forest games
• An extension of the \(\tau\)-value to games with coalition structures.
• Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
• An efficient and fair solution for communication graph games
• The average tree solution for cycle-free graph games
• A characterization of the position value
• Values for games with two-level communication structures
• A TWO-STEP SHAPLEY VALUE FOR COOPERATIVE GAMES WITH COALITION STRUCTURES
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games

This page was built for publication: Component-wise proportional solutions for communication graph games