Quickest detection with discretely controlled observations
From MaRDI portal
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
- 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
- scientific article; zbMATH DE number 5016447 (Why is no real title available?)
- Mean exit times and the multilevel Monte Carlo method
- On a quickest detection problem with costly information
- On Optimum Methods in Quickest Detection Problems
- 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 standard Poisson disorder problem revisited
- The Wiener disorder problem with finite horizon
- Wiener disorder problem with observations at fixed discrete time epochs
Cited in
(9)- Multiple stopping time POMDPs: structural results \& application in interactive advertising on social media
- Asset liquidation under drift uncertainty and regime-switching volatility
- A quickest detection problem with an observation cost
- Bayesian quickest detection in sensor arrays
- A remark on the quickest detection problems
- Disorder detection with costly observations
- Quickest Change Detection With Observation Scheduling
- Data-efficient quickest change detection with on-off observation control
- A detection problem with a monotone observation rate
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)