Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games

DOI10.1007/978-3-642-38233-8_14zbMath1382.91020arXiv1211.2090OpenAlexW1853731358MaRDI QIDQ4924646

Andreas Emil Feldmann, Max Klimm, Matúš Mihalák, Yann Disser

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.2090

zbMATH Keywords

price of stabilitypotential-optimal price of anarchypotential-optimal price of stabilityundirected Shapley network design game

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (4)

Multicast Network Design Game on a Ring ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Designing cost-sharing methods for Bayesian games ⋮ Designing Networks with Good Equilibria under Uncertainty

This page was built for publication: Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games