Quickest detection with discretely controlled observations

DOI10.1080/07474946.2015.995993MaRDI QIDQ4982004zbMATH OpenOpenAlexFDO

Authors Erhan Bayraktar, Ross Kravitz

Publication date 23 March 2015

Published in Sequential Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.4717

zbMATH Keywords

continuous timeBayesian change point detectionfinitely many sampling rights

Mathematics Subject Classification ID

Bayesian inference (62F15) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Abstract: We study a continuous time Bayesian quickest detection problem in which observation times are a scarce resource. The agent, limited to making a finite number of discrete observations, must adaptively decide his observation strategy to minimize detection delay and the probability of false alarm. Under two different models of observation rights, we establish the existence of optimal strategies, and formulate an algorithmic approach to the problem via jump operators. We describe algorithms for these problems, and illustrate them with some numerical results. As the number of observation rights tends to infinity, we also show convergence to the classical continuous observation problem of Shiryaev.

Recommendations

• Data-efficient quickest change detection with on-off observation control
• A quickest detection problem with an observation cost
• Quickest detection problems: fifty years later
• Quickest detection of a state-dependent change-point in discrete time
• Bayesian quickest detection problems for some diffusion processes

Cites work

• scientific article; zbMATH DE number 5016447 (Why is no real title available?)
• A note on sequential detection with exponential penalty for the delay.
• A stochastic approximation for fully nonlinear free boundary parabolic problems
• Adaptive Poisson disorder problem
• Bayesian Quickest Change-Point Detection With Sampling Right Constraints
• Data-Efficient Quickest Change Detection in Minimax Settings
• Data-efficient quickest change detection with on-off observation control
• Mean exit times and the multilevel Monte Carlo method
• On Optimum Methods in Quickest Detection Problems
• On a quickest detection problem with costly information
• Optimal Stopping Rules
• Poisson Disorder Problem with Exponential Penalty for Delay
• Sequential change-point detection in continuous time when the post-change drift is unknown
• Surveillance problems: Wiener processes
• Survey of Measurable Selection Theorems
• The Wiener disorder problem with finite horizon
• The standard Poisson disorder problem revisited
• Wiener disorder problem with observations at fixed discrete time epochs

Cited in

(9)

• A quickest detection problem with an observation cost
• Data-efficient quickest change detection with on-off observation control
• Multiple stopping time POMDPs: structural results \& application in interactive advertising on social media
• Disorder detection with costly observations
• Asset liquidation under drift uncertainty and regime-switching volatility
• A detection problem with a monotone observation rate
• Quickest Change Detection With Observation Scheduling
• Bayesian quickest detection in sensor arrays
• A remark on the quickest detection problems

This page was built for publication: Quickest detection with discretely controlled observations

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