Abstract
We consider the following online decision problem. The vertices of a directed path are being observed one by one in some random order by a selector. At time t the selector examines the t th vertex and knows the graph induced by the t vertices that have already been examined. The selector’s aim is to choose the currently examined vertex maximizing the probability that it belongs to some prescribed subset of vertices. The optimal stopping time for a subset consisting of the two top vertices is given. For the path of cardinality n the numerical approximation of the probability of the right choice according to the optimal algorithm is given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
