Quickest Search Over Multiple Sequences

DOI10.1109/TIT.2011.2159038MaRDI QIDQ5273492zbMATH OpenOpenAlexFDO

Authors Lifeng Lai, H. Vincent Poor, Yan Xin, Georgios Georgiadis

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2011.2159038

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Bayesian inference (62F15) Optimal stopping in statistics (62L15) Detection theory in information and communication theory (94A13)

Cited in

(5)

• Scanning multiple sequences via cache memory
• When is it best to follow the leader?
• Optimal real-time detection of a drifting Brownian coordinate
• Quickest search over Brownian channels
• Quickest Search and Learning Over Correlated Sequences: Theory and Application

This page was built for publication: Quickest Search Over Multiple Sequences

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