Specializations and generalizations of the Stackelberg minimum spanning tree game

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

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

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 networksminimum spanning treeStackelberg gamesnetwork pricing games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On the Complexity of Stackelberg Matroid Pricing Problems ⋮ Computational comparisons of different formulations for the Stackelberg minimum spanning tree game ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting ⋮ Stackelberg packing games

Cites Work

• Unnamed Item
• The Stackelberg minimum spanning tree game
• Some APX-completeness results for cubic graphs
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Stackelberg network pricing games
• An overview of Stackelberg pricing in networks
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Stackelberg network pricing is hard to approximate
• On stackelberg pricing with computationally bounded customers
• An approximation algorithm for Stackelberg network pricing
• Approximation and Online Algorithms