On the Hardness of Network Design for Bottleneck Routing Games

DOI10.1007/978-3-642-33996-7_14zbMath1284.91020arXiv1207.5212OpenAlexW2090556933WikidataQ59818414 ScholiaQ59818414MaRDI QIDQ4910942

Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis

Publication date: 13 March 2013

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Paradoxes in social networks with multiple products

This page was built for publication: On the Hardness of Network Design for Bottleneck Routing Games