Quickest Change Detection in Discrete-Time in Presence of a Covert Adversary

arXiv:2601.20022v2 Announce Type: replace Abstract: We study the problem of covert quickest change detection in a discrete-time setting, where a sequence of observations undergoes a distributional change at an unknown time. Unlike classical formulations, we consider a covert a...

🔗 Read more: https://arxiv.org/abs/2601.20022

#News #Policy #Psychology #Academic