Sequential Shortest Path Interdiction with Incomplete Information
From MaRDI portal
Publication:4692013
DOI10.1287/deca.2015.0325zbMath1398.91165OpenAlexW2179721482MaRDI QIDQ4692013
Juan S. Borrero, Denis Sauré, Oleg A. Prokopyev
Publication date: 24 October 2018
Published in: Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/deca.2015.0325
Decision theory (91B06) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (16)
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ A survey on bilevel optimization under uncertainty ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ On the multistage shortest path problem under distributional uncertainty ⋮ On Bilevel Optimization with Inexact Follower ⋮ A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs ⋮ Network interdiction with asymmetric cost uncertainty ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Timely Decision Analysis Enabled by Efficient Social Media Modeling ⋮ A survey of network interdiction models and algorithms ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling costly learning and counter-learning in a defender-attacker game with private defender information
- Network interdiction via a critical disruption path: branch-and-price algorithms
- An integer programming framework for critical elements detection in graphs
- Combinatorial bandits
- Modeling secrecy and deception in a multiple-period attacker-defender signaling game
- Asymptotically efficient adaptive allocation rules
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Exact identification of critical nodes in sparse networks via new compact formulations
- An overview of bilevel optimization
- Stochastic Network Interdiction
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Adaptive routing with end-to-end feedback
- Finding the n Most Vital Links in Flow Networks
- Finding the n Most Vital Nodes in a Flow Network
- Maximizing the minimum source-sink path subject to a budget constraint
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Governments' and Terrorists' Defense and Attack in a T-Period Game
- Robust Adversarial Risk Analysis: A Level-k Approach
- Shortest-path network interdiction
- The Nonstochastic Multiarmed Bandit Problem
- Two-Person Zero-Sum Games for Network Interdiction
- Selected Topics in Critical Element Detection
- Prediction, Learning, and Games
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- Some aspects of the sequential design of experiments
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Sequential Shortest Path Interdiction with Incomplete Information
