Optimal and myopic search in a binary random vector

作     者：Dor, A Greenshtein, E Korach, E 

作者机构：HaNegev Coll IL-79165 DN Hof Ashkelon Israel Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel Ben Gurion Univ Negev Dept Ind Engn & Management IL-84105 Beer Sheva Israel 

出 版 物：《JOURNAL OF APPLIED PROBABILITY》 (J. Appl. Probab.)

年 卷 期：1998年第35卷第2期

页      面：463-472页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0714[理学-统计学（可授理学、经济学学位）] 0701[理学-数学] 

主　　题：greedy algorithm negative correlation 

摘      要：Let X = (X-1,..., 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 expected number of coordinates inspected using optimal and greedy searching policies.