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

DOI10.1016/J.ECONLET.2016.07.030MaRDI QIDQ1668516zbMATH OpenOpenAlexFDO

Authors Sylvain Béal, André Casajus, Frank Huettner

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

communication graphefficiencyefficient extensionfair extensionfairnessmyerson value

Mathematics Subject Classification ID

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

Recommendations

• Efficient extensions of the Myerson value
• Efficient extensions of communication values
• Efficient extension of the Owen value with graph-restricted communication
• The efficient proportional Myerson values
• Efficient quotient extensions of the Myerson value

Cites work

• A matrix approach to TU games with coalition and communication structures
• An efficient and fair solution for communication graph games
• Efficient extensions of the Myerson value
• Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)

Cited in

(10)

• Efficient extensions of communication values
• The position value and the Myerson value for hypergraph communication situations
• The efficient proportional Myerson values
• An efficient and fair solution for communication graph games
• Efficient extension of the Owen value with graph-restricted communication
• Efficient extensions of the Myerson value based on endogenous claims from players
• Solidarity value for graph games
• k-boundedness, feasible communication structures, and the Myerson value
• Efficient quotient extensions of the Myerson value
• Efficient extensions of the Myerson value

This page was built for publication: On the existence of efficient and fair extensions of communication values for connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668516)