Abstract
We consider a generalization of the best choice problem to upward directed graphs. We describe a strategy for choosing a maximal element (i.e., an element with no outgoing edges) when a selector knows in advance only the number n of vertices of the graph. We show that, as long as the number of elements dominated directly by the maximal ones is not greater than c1n for some positive constant c1 and the indegree of remaining vertices is bounded by a constant D, the probability pn of the right choice according to our strategy satisfies lim infn→∞pnn≥δ>0, where δ is a constant depending on c1 and D.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.