On the existence of efficient and fair extensions of communication values for connected graphs

DOI10.1016/j.econlet.2016.07.030zbMath1398.91034OpenAlexW2476384752MaRDI QIDQ1668516

Sylvain Béal, Frank Huettner, André Casajus

Publication date: 29 August 2018

Published in: Economics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.econlet.2016.07.030

zbMATH Keywords

fairnessefficiencycommunication graphmyerson valueefficient extensionfair extension

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Signaling and communication in game theory (91A28)

Related Items

Efficient quotient extensions of the Myerson value, Efficient extensions of communication values, Efficient extensions of the Myerson value based on endogenous claims from players, The efficient proportional Myerson values

Cites Work

• Unnamed Item
• A matrix approach to TU games with coalition and communication structures
• Efficient extensions of the Myerson value
• 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
• Graphs and Cooperation in Games