Minimax functions on Galton-Watson trees
James B. Martin, Roman Stasi\'nski

TL;DR
This paper analyzes the behavior of minimax recursions on Galton-Watson trees, revealing diverse limiting distributions and examining how much of the tree's information is needed for near-optimal play, depending on offspring distribution.
Contribution
It extends previous work by characterizing the limiting behavior of minimax values on Galton-Watson trees with general offspring distributions and explores endogeny and information requirements.
Findings
Unrescaled game values can converge to constants, discrete, or continuous distributions.
Distributional limits depend on the offspring distribution.
The amount of tree information needed for near-optimal play varies with offspring distribution.
Abstract
We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson branching process, truncated at some depth , and the terminal values of the level- nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as the value of the game converges to a constant, and by Ali Khan, Devroye and Neininger, who obtained a distributional limit under a suitable rescaling. For a general offspring distribution, there is a surprisingly rich variety of behaviour: the (unrescaled) value of the game may converge to a constant, or to a discrete limit with several atoms, or to a continuous distribution. We also give distributional limits…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
