Combinatorial games on Galton-Watson trees involving several-generation-jump moves
Moumanti Podder, Dhruv Bhasin

TL;DR
This paper analyzes combinatorial $k$-jump games on Galton-Watson trees, deriving probabilities of outcomes, phase transitions, and decay rates, with a focus on Poisson offspring distributions and game duration conditions.
Contribution
It introduces fixed point characterizations of game outcomes on Galton-Watson trees and compares different $k$-jump game variants under Poisson offspring distributions.
Findings
Probabilities of game outcomes expressed as fixed points.
Phase transition conditions for draw probabilities in Poisson trees.
Decay rate of losing probability as offspring mean increases.
Abstract
We study the -jump normal and -jump mis\`{e}re games on rooted Galton-Watson trees, expressing the probabilities of various outcomes of these games as specific fixed points of certain functions that depend on and the offspring distribution. We discuss results on phase transitions pertaining to draw probabilities when the offspring distribution is Poisson (i.e. for which values of , the draw probability is strictly positive). We compare the probabilities of the various outcomes of the -jump normal game with those of the -jump mis\`{e}re game, and a similar comparison is drawn between the -jump normal game and the -jump normal game, under the Poisson regime. We describe the rate of decay of the probability that the first player loses the -jump normal game as . Finally, we discuss a sufficient condition for the…
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.
Taxonomy
TopicsSports Analytics and Performance · Game Theory and Applications · Artificial Intelligence in Games
