The decentralized quickest detection problem

DOI10.1109/TAC.1984.1103601MaRDI QIDQ3342232zbMATH OpenFDO

Authors Demosthenis Teneketzis, Pravin Varaiya

Publication date 1984

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1984.1103601

zbMATH Keywords

coupled decisionsdetection problemjump detectionMarkov chain jumpthreshold type optimal policy

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Decentralized quickest change detection
• On the complexity of decentralized decision making and detection problems
• Data-efficient minimax quickest change detection in a decentralized system
• Asymptotic Optimality in Byzantine Distributed Quickest Change Detection
• Sequential Problems in Decentralized Detection With Communication
• One Shot Schemes for Decentralized Quickest Change Detection
• Distributed Detection in Ad Hoc Networks Through Quantized Consensus
• Consensus-Based Distributed Quickest Detection of Attacks With Unknown Parameters
• A quickest detection problem with an observation cost
• A remark on the quickest detection problems

Cited in

(10)

• The decentralized Wald problem
• Decentralized stochastic control
• scientific article; zbMATH DE number 3987023 (Why is no real title available?)
• Decentralized sequential detection
• A remark on the quickest detection problems
• Byzantine Fault Tolerant Distributed Quickest Change Detection
• Spreading Alerts Quietly and the Subgroup Escape Problem
• Dynamic games among teams with delayed intra-team information sharing
• Spreading alerts quietly and the subgroup escape problem
• Dynamic sequential team multi-hypothesis testing under uniformly distributed nonstationary observations

This page was built for publication: The decentralized quickest detection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342232)