arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.07358cs.DScs.AI
收藏

AND-OR树上独立分布的非深度优先搜索

Non-Depth-First Search against Independent Distributions on an AND-OR Tree

Tokyo Metropolitan University(东京都立大学)

Toshio Suzuki

摘要:

Suzuki和Niida(Ann. Pure. Appl. Logic,2015)展示了以下关于AND-OR树上的独立分布(ID)的结果,其中他们只考虑了深度优先算法。(1)在ID中,使得根具有值0的概率被固定为给定的r,使得0 < r < 1,如果d是最佳算法的成本的最大化者,则d是独立且相同的分布(IID)。(2)在所有ID中,如果d是最佳算法的成本最大化者,则d是IID。在考虑非深度优先算法的情况下,在上述工作中(1)和(2)的对应部分是开放的。Peng et al.(Inform.过程信件:2017)将(1)和(2)扩展到多分支树,其中在(2)中,他们对ID附加了一个假设,即根具有值0的概率既不是0也不是1。对于铃木新田的两个问题,我们给出了肯定的回答。证明的一个关键是,如果ID d在ID之间达到均衡,那么我们可以从深度优先算法中选择一个对d成本最佳的算法。此外,我们将Peng等人的结果推广到非深度优先算法的情况。

英文摘要:

Suzuki and Niida (Ann. Pure. Appl. Logic, 2015) showed the following results on independent distributions (IDs) on an AND-OR tree, where they took only depth-first algorithms into consideration. (1) Among IDs such that probability of the root having value 0 is fixed as a given r such that 0 < r < 1, if d is a maximizer of cost of the best algorithm then d is an independent and identical distribution (IID). (2) Among all IDs, if d is a maximizer of cost of the best algorithm then d is an IID. In the case where non-depth-first algorithms are taken into consideration, the counter parts of (1) and (2) are left open in the above work. Peng et al. (Inform. Process. Lett., 2017) extended (1) and (2) to multi-branching trees, where in (2) they put an additional hypothesis on IDs that probability of the root having value 0 is neither 0 nor 1. We give positive answers for the two questions of Suzuki-Niida. A key to the proof is that if ID d achieves the equilibrium among IDs then we can chose an algorithm of the best cost against d from depth-first algorithms. In addition, we extend the result of Peng et al. to the case where non-depth-first algorithms are taken into consideration.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑