Optimal stopping on patterns in strings generated by independent random variables

DOI10.1239/JAP/1044476827MaRDI QIDQ4408535zbMATH OpenOpenAlexFDO

Authors F. Thomas Bruss, Guy Louchard

Publication date 3 November 2003

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6d7de3bf897a5c8a7c54583bcb129f5413aafe25

zbMATH Keywords

algorithms on wordsodds algorithmonline decisionspattern correlation

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• Optimal pattern matching algorithms
• Explicit Distributional Results In Pattern Formation II
• Sum the odds to one and stop
• Stopping Probabilities for Patterns in Markov Chains
• On optimal stopping of random sequences modulated by Markov chain

Cited in

(2)

• Selecting the last consecutive record in a record process
• The odds algorithm based on sequential updating and its performance

This page was built for publication: Optimal stopping on patterns in strings generated by independent random variables

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