Sequential Interdiction with Incomplete Information and Learning

DOI10.1287/opre.2018.1773zbMath1443.90206OpenAlexW2912474513MaRDI QIDQ4971578

Oleg A. Prokopyev, Juan S. Borrero, Denis Sauré

Publication date: 12 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3dd5918d2eb1fd35471c687da584c7208621ba0d

zbMATH Keywords

learningrobust optimizationincomplete informationbilevel programmingonline optimizationinterdictionattacker-defender

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (10)

Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ A survey on bilevel optimization under uncertainty ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ On the multistage shortest path problem under distributional uncertainty ⋮ A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs ⋮ Improving connectivity of compromised digital networks via algebraic connectivity maximisation ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback

Cites Work

• Unnamed Item
• Unnamed Item
• Links between linear bilevel and mixed 0-1 programming problems
• A bilevel programming approach to determining tax credits for biofuel production
• A note on linearized reformulations for a class of bilevel linear integer problems
• Deterministic network interdiction
• An overview of bilevel optimization
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• A decomposition algorithm applied to planning the interdiction of stochastic networks
• Sequential Shortest Path Interdiction with Incomplete Information
• Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
• Shortest-path network interdiction
• The Nonstochastic Multiarmed Bandit Problem
• A Complexity and Approximability Study of the Bilevel Knapsack Problem
• Regret in Online Combinatorial Optimization
• A Two-Sided Optimization for Theater Ballistic Missile Defense
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Prediction, Learning, and Games

This page was built for publication: Sequential Interdiction with Incomplete Information and Learning