Two efficient values of cooperative games with graph structure based on \(\tau\)-values

DOI10.1007/s10878-016-0081-1zbMath1411.91051OpenAlexW2522737590MaRDI QIDQ2410098

Guang Zhang, Yanxia Dong, Erfang Shan, Li-ying Kang

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0081-1

zbMATH Keywords

efficient solutiongraph games\(\tau\)-valuesfair distribution of surplus solutiontwo-step \(\tau\)-value

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Two-step values for games with two-level communication structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Owen-type value for games with two-level communication structure
• Efficient extensions of the Myerson value
• An axiomatization of the \(\tau\)-value
• 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
• Values for games with two-level communication structures
• A TWO-STEP SHAPLEY VALUE FOR COOPERATIVE GAMES WITH COALITION STRUCTURES
• Graphs and Cooperation in Games

This page was built for publication: Two efficient values of cooperative games with graph structure based on \(\tau\)-values