Optimal and myopic search in a binary random vector

Avner Dor, Eitan Greenshtein, Ephraim Korach

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Let X = (X1, …, Xn) be a random binary vector, with a known joint distribution P. It is necessary to inspect the coordinates sequentially in order to determine if Xi = 0 for every i, i = 1, …, n. We find bounds for the ratio of the expectednumber of coordinates inspected using optimal and greedy searching policies.

Original languageEnglish
Pages (from-to)463-472
Number of pages10
JournalJournal of Applied Probability
Volume35
Issue number2
DOIs
StatePublished - 1 Jan 1998

Keywords

  • Greedy algorithm
  • Negative correlation

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics (all)
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Optimal and myopic search in a binary random vector'. Together they form a unique fingerprint.

Cite this