Efficient extensions of the Myerson value

DOI10.1007/S00355-015-0885-4zbMATH Open1341.91010OpenAlexW2259912068MaRDI QIDQ904834FDOQ904834

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

Publication date: 14 January 2016

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://crese.univ-fcomte.fr/uploads/wp/WP-2015-01.pdf

Recommendations

• Efficient extensions of communication values
• The efficient proportional Myerson values
• Efficient quotient extensions of the Myerson value
• On the existence of efficient and fair extensions of communication values for connected graphs
• The efficient proportional Myerson values for hypergraph games

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Cooperative games with coalition structures
• Title not available (Why is that?)
• Graphs and Cooperation in Games
• 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
• Endogenous Formation of Coalitions
• A matrix approach to TU games with coalition and communication structures
• Networks and outside options

Cited In (22)

• Efficient quotient extensions of the Myerson value
• The efficient proportional Myerson values
• Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations
• Efficient extension of the Owen value with graph-restricted communication
• Efficient extensions of communication values
• On the existence of efficient and fair extensions of communication values for connected graphs
• The Egalitarian efficient extension of the Aumann-Drèze value
• Fair distribution of surplus and efficient extensions of the Myerson value
• An axiomatization of the Myerson value
• Efficient Myerson value for union stable structures
• Efficiency and collusion neutrality in cooperative games and networks
• Two efficient values of cooperative games with graph structure based on \(\tau\)-values
• Graph games and edge density of graphs
• A non-parametric approach to testing the axioms of the Shapley value with limited data
• Allocation rules for communication situations with incompatibilities
• A matrix approach to TU games with coalition and communication structures
• The efficient proportional Myerson values for hypergraph games
• An efficient and fair solution for communication graph games
• The efficient partition surplus Owen graph value
• Graph monotonic values
• Efficient extensions of the Myerson value based on endogenous claims from players
• Uncertain production environment and communication structure

This page was built for publication: Efficient extensions of the Myerson value

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