 
Summary: Proceedings of 24th Conference
on Decision and Control
Ft.Lauderdale, FL December 1985
TP4  4~30
AN OPTIMAL STRATEGY FOR .4COSFLlCT RESOLUTIOS PROBLEM
V. Anantharam and Pravin L'araiya
Department of Electrical Engineering and Computer Science
and Electronics Research Laboratory.
University of California, Berkeley.
Summary
Aproblem of relevancetothe design of multiple access
protocols is thefollowing : Let X1,...,Xs be i.i.d. randomvari
ibles uniformly distributed in [O. 11. We have to determine the
largest Xi ,1 6i
[O. 11 andask "Do you belong to A(1) ? ", whereupon eachX,
responds with a yes or a no. Based on these responses we pick a
setA(2) C [0, 11 and ask " Do you belong to the set A(2) ? " ,
and so on. Is there an optimal strategy to choose the sets A(1).
A(2). ... so astominimizethe expected number of questions
requiredtodeterminethelargest Xi ? Further,what is the
