Optimal and myopic search in a binary random vector

DOI10.1239/JAP/1032192861MaRDI QIDQ4215691zbMATH OpenOpenAlexFDO

Authors Avner Dor, Eitan Greenshtein, Ephraim Korach

Publication date 29 November 1998

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

Full work available at URL https://doi.org/10.1239/jap/1032192861

zbMATH Keywords

greedy algorithmnegative correlation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to probability theory (60-04) Inequalities; stochastic orderings (60E15)

Recommendations

• The Greedy Search Algorithm on Binary Vectors
• An almost-greedy search on random binary vectors and random graphs
• Optimal sequential search: A Bayesian approach
• scientific article; zbMATH DE number 3924495
• A Dichotomous Search for a Geometric Random Variable

Cited in

(1)

• The Greedy Search Algorithm on Binary Vectors

This page was built for publication: Optimal and myopic search in a binary random vector

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