Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
type: Item
instance of: scholarly article
title: Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
zbMATH Open document ID: 1303.91056
author: Andreas Emil Feldmann
author: Max Klimm
author: Y. Disser
author: Matúš Mihalák
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6376001
zbMATH Keywords: undirected Shapley network design game
zbMATH Keywords: price of stability
zbMATH Keywords: potential-optimal price of stability
zbMATH Keywords: potential-optimal price of anarchy
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.037
OpenAlex ID: W2027154380
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: The statistical mechanics of best-response strategy revision
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: An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
cites work: Potential games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q3524728
DOI: 10.1016/J.TCS.2014.10.037
description: scientific article; zbMATH DE number 6376001