Tracking stopping times

Urs Niesen, Aslan Tchamkerten, Gregory Wornell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Let {(Xi, Yi)} ∞ be a sequence of pairs i of random variables, and let S be a bounded stopping time with respect to {Xi}∞ i=1. We propose the problem of finding a stopping time T with respect to {Yi}∞ i=1 that optimally tracks S in the sense that T minimizes the average reaction time E(T S)+ while keeping the false-Alarm probability P(T < S) below a given threshold α. This problem has applications in many different areas. In this paper we present an application related to communication over a channel with noisy feedback.

Original languageEnglish
Title of host publication44th Annual Allerton Conference on Communication, Control, and Computing 2006
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1432-1436
Number of pages5
ISBN (Electronic)9781604237924
Publication statusPublished - 1 Jan 2006
Externally publishedYes
Event44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States
Duration: 27 Sept 200629 Sept 2006

Publication series

Name44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume3

Conference

Conference44th Annual Allerton Conference on Communication, Control, and Computing 2006
Country/TerritoryUnited States
CityMonticello
Period27/09/0629/09/06

Fingerprint

Dive into the research topics of 'Tracking stopping times'. Together they form a unique fingerprint.

Cite this