Learning the follower's objective function in sequential bilevel games
From MaRDI portal
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
- Bilevel knapsack with interdiction constraints
- Bilevel programming and price setting problems
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Deep learning based high accuracy heuristic approach for knapsack interdiction problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Foundations of bilevel programming
- Inverse Optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- Optimization with constraint learning: a framework and survey
- Sequential interdiction with incomplete information and learning
- Sequential Shortest Path Interdiction with Incomplete Information
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- The multiplicative weights update method: a meta-algorithm and applications
- The polynomial hierarchy and a simple model for competitive analysis
- Two-Level Linear Programming
- Using neural networks to solve linear bilevel problems with unknown lower level
This page was built for publication: Learning the follower's objective function in sequential bilevel games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228082)