The Stackelberg Minimum Spanning Tree Game
From MaRDI portal
Publication:3603515
DOI10.1007/978-3-540-73951-7_7zbMath1209.68634MaRDI QIDQ3603515
Samuel Fiorini, Oren Weimann, Erik D. Demaine, Ilan Newman, Gwenaël Joret, Stefan Langerman, Jean Cardinal
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7644
91A43: Games involving graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Efficient heuristic algorithms for maximum utility product pricing problems, The Stackelberg minimum spanning tree game, Stackelberg network pricing games, Stackelberg network pricing is hard to approximate