Specializations and generalizations of the Stackelberg minimum spanning tree game

DOI10.1016/j.tcs.2014.11.009zbMath1303.68090arXiv1407.1167MaRDI QIDQ476917

Guido Proietti, Davide Bilò, Luciano Gualà, Stefano Leucci

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

communication networks; minimum spanning tree; Stackelberg games; network pricing games

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B18: Communication networks in operations research

91A43: Games involving graphs

68R10: Graph theory (including graph drawing) in computer science

Related Items

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs