notesum.ai

Published at October 21

Patrol Security Game: Defending Against Adversary with Freedom in Attack Timing, Location, and Duration

cs.LG

cs.AI

Released Date: October 21, 2024

Authors: Hao-Tsung Yang¹, Ting-Kai Weng¹, Ting-Yu Chang¹, Kin Sum Liu², Shan Lin³, Jie Gao⁴, Shih-Yu Tsai⁵

Aff.: ¹Department of Computer Science and Information Science, National Central University, Taiwan, R.O.C.; ²Department of Ads Quality, DoorDash inc., USA; ³Department of Electrical and Computer Engineering, Stony Brook University, USA; ⁴Department of Computer Science, Rutgers University, USA; ⁵Department of Information Management and Finance, National Yang Ming Chiao Tung University, Taiwan, R.O.C.

Arxiv: https://arxiv.org/abs/2410.15600v1

$\alpha$	$\alpha<\frac{1}{n}$	$\alpha=\Theta(1)$	$\alpha>\frac{n-1}{n}$
EMR	$O(n^{d+1}\log^{d+1}n)$	$O(\log^{d+1}n)$	$O((1+\frac{n}{n-1})^{d+1})$
$\mathcal{H_{r}}$	$\Theta(\log n)$	$\Theta(1)$	$\frac{\log n}{n}$