Eigen-distribution on assignments for game trees with random properties

In this paper, we investigate a special distribution, called eigen-distribution, on assignments for game tree Tk2 with random properties. There are two cases, where the assignments to leaves are independently distributed (ID) and correlated distributed (CD). In ID setting, we prove that the distributional probability ϱ belongs to [EQUATION] and ϱ is a strictly increasing function on rounds [EQUATION]. In CD setting, we propose a reverse assigning technique (RAT) to form 1-set and 0-set, then show that E1-distribution (namely, a particular distribution on assignments of 1-set such that the complexity of any deterministic algorithm is equal) is the unique eigen-distribution.

[1]  Michael Tarsi,et al.  Optimal Search on Some Game Trees , 1983, JACM.

[2]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Judea Pearl,et al.  Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..

[4]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).