Optimal and myopic search in a binary random vector

Avner Dor; Eitan Greenshtein; Ephraim Korach

doi:10.1239/jap/1032192861

Optimal and myopic search in a binary random vector

Avner Dor, Eitan Greenshtein, Ephraim Korach

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Let X = (X₁, …, X_n) be a random binary vector, with a known joint distribution P. It is necessary to inspect the coordinates sequentially in order to determine if X_i = 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 language	English
Pages (from-to)	463-472
Number of pages	10
Journal	Journal of Applied Probability
Volume	35
Issue number	2
DOIs	https://doi.org/10.1239/jap/1032192861 https://doi.org/10.1017/S0021900200015084
State	Published - 1 Jan 1998

Keywords

Greedy algorithm
Negative correlation

ASJC Scopus subject areas

Statistics and Probability
General Mathematics
Statistics, Probability and Uncertainty

Access to Document

Cite this

@article{05355978aefb46a8b00f199c41ef3703,

title = "Optimal and myopic search in a binary random vector",

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.",

keywords = "Greedy algorithm, Negative correlation",

author = "Avner Dor and Eitan Greenshtein and Ephraim Korach",

year = "1998",

month = jan,

day = "1",

doi = "10.1239/jap/1032192861",

language = "English",

volume = "35",

pages = "463--472",

journal = "Journal of Applied Probability",

issn = "0021-9002",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - Optimal and myopic search in a binary random vector

AU - Dor, Avner

AU - Greenshtein, Eitan

AU - Korach, Ephraim

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

KW - Greedy algorithm

KW - Negative correlation

UR - http://www.scopus.com/inward/record.url?scp=85037881608&partnerID=8YFLogxK

U2 - 10.1239/jap/1032192861

DO - 10.1239/jap/1032192861

M3 - Article

AN - SCOPUS:0032383077

SN - 0021-9002

VL - 35

SP - 463

EP - 472

JO - Journal of Applied Probability

JF - Journal of Applied Probability

IS - 2

ER -

Optimal and myopic search in a binary random vector

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this