Stackelberg Max Closure with Multiple Followers
From MaRDI portal
Recommendations
- Multiple stack branch and bound
- scientific article; zbMATH DE number 57452
- Stackelberg strategies for stochastic systems with multiple followers
- Scalable threshold closure
- Multicriterial maximinimax
- Multiple Stackelberg variational responses
- New approach to linear Stackelberg problems with multiple leaders-follower
- Dynamic programming to minimize the maximum number of open stacks
- Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers
- Cyclic behavior of maxima in a hierarchical summation scheme
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- An approximation algorithm for Stackelberg network pricing
- An overview of Stackelberg pricing in networks
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Negative prices in network pricing games
- Optimization, approximation, and complexity classes
- Reducibility among combinatorial problems
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- Some APX-completeness results for cubic graphs
- Stackelberg bipartite vertex cover and the preflow algorithm
- Stackelberg network pricing games
- Stackelberg network pricing is hard to approximate
- Stackelberg packing games
- The asymmetric median tree. --- A new model for building consensus trees
- The Stackelberg minimum spanning tree game
This page was built for publication: Stackelberg Max Closure with Multiple Followers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870364)
