An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games

DOI10.1007/978-3-662-44465-8_46zbMath1427.91062arXiv1406.3597OpenAlexW3100003931MaRDI QIDQ2922640

Simone Montemezzani, Matúš Mihalák, Akaki Mamageishvili

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) (n)-person games, (n>2) (91A06)

Related Items (2)

Multicast Network Design Game on a Ring ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares

This page was built for publication: An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games