Stackelberg Max Closure with Multiple Followers
From MaRDI portal
Publication:5870364
DOI10.1287/moor.2021.1240OpenAlexW4220751845MaRDI QIDQ5870364
Karsten Jungnitsch, Marc Schröder, Britta Peis
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1240
Hierarchical games (including Stackelberg games) (91A65) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Stackelberg bipartite vertex cover and the preflow algorithm
- The Stackelberg minimum spanning tree game
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- Stackelberg network pricing games
- An overview of Stackelberg pricing in networks
- Negative prices in network pricing games
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Stackelberg network pricing is hard to approximate
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Reducibility among Combinatorial Problems
- An approximation algorithm for Stackelberg network pricing
- Stackelberg packing games
- The asymmetric median tree. --- A new model for building consensus trees
This page was built for publication: Stackelberg Max Closure with Multiple Followers
