Equal-need sharing of a network under connectivity constraints
type: Item
instance of: scholarly article
title: Equal-need sharing of a network under connectivity constraints
zbMATH Open document ID: 1236.91094
author: Hervé Moulin
author: Francois Laigret
published in: Games and Economic Behavior
publication date: 2011-05-16T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 5888234
zbMATH Keywords: cost sharing
zbMATH Keywords: network
zbMATH Keywords: connectivity
zbMATH Keywords: stand alone core
MaRDI profile type: Publication
full work available at URL: j.geb.2010.08.002
OpenAlex ID: W2073865253
cites work: Q5708490
cites work: Geometric algorithms and combinatorial optimization
cites work: Q4845372
cites work: Cooperative facility location games
cites work: The clustering matroid and the optimal clustering tree
cites work: The complete optimal stars-clustering-tree problem
cites work: Sharing the cost of a network: core and core allocations
cites work: A Simple Expression for the Shapley Value in a Special Case
cites work: The Nucleolus of a Characteristic Function Game
cites work: Q5817870
DOI: 10.1016/J.GEB.2010.08.002
Recommended article: On the capacity of disjointly shared networks
Recommended article: Network stability under max-min fair bandwidth sharing
Recommended article: Fair allocation on a network
Recommended article: Q3045061
Recommended article: Efficient, fair, and strategy-proof (re)allocation under network constraints
Recommended article: Q4808674
Recommended article: Q3536551
Recommended article: A stability conjecture on bandwidth sharing networks
Recommended article: On equilibrium routing in data-transmission networks
Recommended article: A new measurement for network sharing fairness
description: scientific article; zbMATH DE number 5888234