Abstract
We consider the following on-line decision problem. The vertices of a directed path of a known length are being observed one by one in some random order by a selector. At time t the selector examines the tth vertex and knows the directed graph induced by the t vertices that have been already examined. The selector's aim is to choose the currently examined vertex maximizing the probability that this vertex is the "uppermost" one, i.e., the only one that does not have an outgoing edge. An optimal algorithm for such a choice (in other words, optimal stopping time) is given. For a cardinality n of the directed path considered, the probability $p_n$ of the right choice according to the optimal algorithm is given, and it is shown that $p_n\sqrt{n} \rightarrow \sqrt{\pi}/2$ as $n \rightarrow \infty$.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
