A double oracle algorithm for allocating resources on nodes in graph-based security games

In the graph-based security game, the defender allocates security resources strategically to protect targets against the adversary. In this paper, firstly, we come up with a new double oracle algorithm for scheduling resources optimally on nodes in graph-based security games. The police scattered on...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Multimedia tools and applications Ročník 77; číslo 9; s. 10961 - 10977
Hlavní autoři: Yang, Zhou, Zhu, Junwu, Teng, Ling, Xu, Jiajie, Zhu, Zeyu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2018
Springer Nature B.V
Témata:
Algorithms
Computer Communication Networks
Computer Science
Data Structures and Information Theory
Games
Greedy algorithms
Multimedia Information Systems
Police
Resource allocation
Resource scheduling
Security
Special Purpose and Application-Based Systems
Minimax equilibria
Mixed integer linear programming
Game theory
Distributed artificial intelligence
Double oracle
ISSN:1380-7501, 1573-7721
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In the graph-based security game, the defender allocates security resources strategically to protect targets against the adversary. In this paper, firstly, we come up with a new double oracle algorithm for scheduling resources optimally on nodes in graph-based security games. The police scattered on the street can only detect those terrorists on that street, while the police at the intersection place can detect all the terriorists on all the streets crisscrossing the intersection. Secondly, in real world situation, even the police meets the criminals at the same place, criminals still could escape. To match the real world situation, we define a parameter called detection probability, representing the chance the attacker is caught when they are checked by the defenders. Thirdly, we design a double oracle algorithm to find the equilibrium. But the computational complexity of best response oracles are extremely high. We design greedy algorithms and combine them with best response oracles to improve the algorithm efficiency without loss of correctness.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-018-5750-x