The ring design game with fair cost allocation
type: Item
instance of: scholarly article
title: The ring design game with fair cost allocation
zbMATH Open document ID: 1303.68026
author: Angelo Fanelli
author: Dariusz Leniowski
author: Gianpiero Monaco
author: Piotr Sankowski
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6375970
zbMATH Keywords: network design
zbMATH Keywords: Nash equilibria
zbMATH Keywords: price of stability
zbMATH Keywords: Shapley cost-sharing
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.09.035
OpenAlex ID: W2138636172
cites work: On the Value of Coordination in Network Design
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Improved lower bounds on the price of stability of undirected network design games
cites work: Network design with weighted players
cites work: On the Price of Stability for Undirected Network Design
cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
cites work: Nash equilibria with minimum potential in undirected broadcast games
cites work: Q3409969
cites work: An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
cites work: A class of games possessing pure-strategy Nash equilibria
DOI: 10.1016/J.TCS.2014.09.035
description: scientific article; zbMATH DE number 6375970