The Stackelberg Minimum Spanning Tree Game

DOI10.1007/978-3-540-73951-7_7zbMath1209.68634OpenAlexW1888560149MaRDI 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

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

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 ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: The Stackelberg Minimum Spanning Tree Game