Abstract
AbstractRecently, Charikar et. al. investigated the problem of evaluating AND/OR trees, with non uniform costs on its leaves, under the perspective of the competitive analysis. For an AND-OR tree T they presented a μ(T)-competitive deterministic polynomial time algorithm, where μ(T) is the number of leaves that must be read, in the worst case, in order to determine the value of T. Furthermore, they prove that μ(T) is a lower bound on the deterministic competitiveness, which assures the optimality of their algorithm.The power of randomization in this context has remained as an open question. Here, we give a step towards solving this problem by presenting a 0.792 μ(T)-competitive randomized polynomial time algorithm. This contrasts with the best known lower bound μ(T)/2.KeywordsInternal NodeCompetitive RatioDeterministic AlgorithmGame TreeCost VectorThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
