Efficient extensions of communication values
type: Item
instance of: scholarly article
title: Efficient extensions of communication values
zbMATH Open document ID: 1391.91014
author: Sylvain Béal
author: André Casajus
author: Frank Huettner
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
full work available at URL: WP-2015-04.pdf
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A28
zbMATH DE Number: 6886489
zbMATH Keywords: efficient extension
zbMATH Keywords: average tree solution
zbMATH Keywords: compensation solution
zbMATH Keywords: position value
zbMATH Keywords: component fairness
zbMATH Keywords: relative fairness
zbMATH Keywords: balanced link contributions
zbMATH Keywords: Myerson value
zbMATH Keywords: component-wise egalitarian solution
MaRDI profile type: Publication
OpenAlex ID: W2107736781
cites work: Cooperative games with coalition structures
cites work: Efficient extensions of the Myerson value
cites work: On the existence of efficient and fair extensions of communication values for connected graphs
cites work: The average tree solution for multi-choice forest games
cites work: Compensations in the Shapley value and the compensation solutions for graph games
cites work: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
cites work: On the Position Value for Communication Situations
cites work: A probabilistic position value
cites work: A matrix approach to TU games with coalition and communication structures
cites work: Endogenous Formation of Coalitions
cites work: The average tree solution for cycle-free graph games
cites work: Values for games with two-level communication structures
cites work: Graphs and Cooperation in Games
cites work: Q4178815
cites work: Q5817870
cites work: A characterization of the position value
cites work: Bidding for surplus in network allocation problems
cites work: An efficient and fair solution for communication graph games
cites work: Two efficient values of cooperative games with graph structure based on \(\tau\)-values
DOI: 10.1007/S10479-017-2661-6
description: scientific article; zbMATH DE number 6886489