Asymptotic properties of levelregular decision trees with randomly evaluated leaves

Game trees are an important model of decision-making situations, both in artificial intelligence and decision analysis. The model most frequently investigated in theoretical research consists of a uniform tree of heighh and a constant branching factorb, where the terminal positions are assigned the values of independent, identically distributed random variables 1, 3–10]. Our paper investigates two generalizations:

1.	Different levels of the tree may have different branching factors.
2.	The preferences of the two players may no longer be totally opposite.