Improving Reliability through Multi-Path Routing and Link Defence: An Application of Game Theory to Transport

Kanturska, Urszula; Schmöcker, Jan-Dirk; Fonzone, Achille; Bell, M.G.

doi:10.1007/978-0-387-87767-9_9

Cited by 7 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kanturska et al [ 101 ] present a rigorous inspection of how transport network reliability can be assessed using game theory when attack probability on different locations is unknown. The approach favoured using a minimax algorithm to distribute risk across multiple paths as long as the travel costs are small relative to potential losses incurred by an attack.…”

Section: Use Of Game Theory In Defence Science and Technology Applica...mentioning

confidence: 99%

Game Theory in Defence Applications: A Review

Rajagopalan

Skvortsov

et al. 2022

Sensors

View full text Add to dashboard Cite

This paper presents a succinct review of attempts in the literature to use game theory to model decision-making scenarios relevant to defence applications. Game theory has been proven as a very effective tool in modelling the decision-making processes of intelligent agents, entities, and players. It has been used to model scenarios from diverse fields such as economics, evolutionary biology, and computer science. In defence applications, there is often a need to model and predict the actions of hostile actors, and players who try to evade or out-smart each other. Modelling how the actions of competitive players shape the decision making of each other is the forte of game theory. In past decades, there have been several studies that applied different branches of game theory to model a range of defence-related scenarios. This paper provides a structured review of such attempts, and classifies existing literature in terms of the kind of warfare modelled, the types of games used, and the players involved. After careful selection, a total of 29 directly relevant papers are discussed and classified. In terms of the warfares modelled, we recognise that most papers that apply game theory in defence settings are concerned with Command and Control Warfare, and can be further classified into papers dealing with (i) Resource Allocation Warfare (ii) Information Warfare (iii) Weapons Control Warfare, and (iv) Adversary Monitoring Warfare. We also observe that most of the reviewed papers are concerned with sensing, tracking, and large sensor networks, and the studied problems have parallels in sensor network analysis in the civilian domain. In terms of the games used, we classify the reviewed papers into papers that use non-cooperative or cooperative games, simultaneous or sequential games, discrete or continuous games, and non-zero-sum or zero-sum games. Similarly, papers are also classified into two-player, three-player or multi-player game based papers. We also explore the nature of players and the construction of payoff functions in each scenario. Finally, we also identify gaps in literature where game theory could be fruitfully applied in scenarios hitherto unexplored using game theory. The presented analysis provides a concise summary of the state-of-the-art with regards to the use of game theory in defence applications and highlights the benefits and limitations of game theory in the considered scenarios.

show abstract

Section: Use Of Game Theory In Defence Science and Technology Applica...mentioning

confidence: 99%

Game Theory in Defence Applications: A Review

Rajagopalan

Skvortsov

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…The problem mainly deals with attacks on networks that may disrupt network operations. Studies concern various types of networks, including telecommunication networks (e.g., Cox [5], Bellmore and Ratliff [6] and Frank et al [7]), transportation networks (e.g., Alderson et al [8], Kanturska et al [9], and Bier and Hausken [10]), Electrical networks (e.g., Fang et al [11]), computer networks (e.g., Obert et al [12], and Hu et al [13]), supply chains (e.g., Zhang et al [14]), and counter-drug interdiction (e.g., Magliocca et al [15] and Zhang et al [16]), to name a few.…”

Section: Literature Reviewmentioning

confidence: 99%

“…An interdiction problem may naturally be considered as a game (e.g., Kanturska et al [9], Yaghlane et al [4], Reilly et al [17], and Bricha and Nourelfath [18]), where the leader attempts to disrupt the network operation while the follower seeks to make necessary moves/adjustments to preserve the network functionality even under some degraded mode. Common actions by the follower to respond to some nodes/links failure include rerouting.…”

Section: Literature Reviewmentioning

confidence: 99%

Attack Strategies on Networks With a Budget Constraint

et al. 2021

View full text Add to dashboard Cite

In this paper, we develop solutions to the problem of identifying the k most vital cut-sets of a network under limited attacking resources in a network interdiction context. We treat three different versions of the problem, each having a different objective: namely, the highest probability of a successful attack, the least cost attack, and the least expected cost attack combining both success probability and attacking cost. We introduce a budget constraint to reflect the resource limitation of the attacker. We consider both the case of disjoint and non-disjoint cut-sets to target. We develop a simulation-optimization approach accounting for various techniques including the shortest path problem and the min-cut problem. The solution method is found to be very efficient even for large-scale networks. We implement the suggested algorithms for illustration purposes.

show abstract

“…Brightwell et al [11] apply relaxations to derive polynomial time solutions through successive shortest path problems. Kanturska et al [12] discuss a transportation network model where multi-path routing and link defense are used for reliability improvement.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimal k Cut-Sets in Attack/Defense Strategies on Networks

et al. 2020

View full text Add to dashboard Cite

The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks the next link to target after identifying the outcome of the attack on the previous one. The attack may continue to reach up to k cut-sets. The problem is to identify which cut-sets to target (referred to as the k-critical cut-sets of the network) that maximize the probability of a successful attack. We distinguish both cases of disjoint and non-disjoint cut-sets. We develop an algorithm for each case with illustrations. We explore the large scale of networks and offer guidelines on the corresponding defensive strategies. INDEX TERMS cut-set, defense, interdiction networks, multiple-attacks, path-set.

show abstract

Improving Reliability through Multi-Path Routing and Link Defence: An Application of Game Theory to Transport

Cited by 7 publications

References 26 publications

Game Theory in Defence Applications: A Review

Game Theory in Defence Applications: A Review

Attack Strategies on Networks With a Budget Constraint

Optimal k Cut-Sets in Attack/Defense Strategies on Networks

Contact Info

Product

Resources

About