Combinatorial games on multi-type Galton-Watson trees

zbMATH Open1490.60027MaRDI QIDQ5087633FDOQ5087633

Authors Moumanti Podder

Publication date 1 July 2022

Full work available at URL https://arxiv.org/abs/2103.08474

zbMATH Keywords

fixed pointsnormalmulti-type Galton-Watson treesbi-type binary treesbi-type Poisson treesmisère and escape gamestwo-player combinatorial games

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65)

Abstract: When normal and mis`{e}re games are played on bi-type binary Galton-Watson trees (with vertices coloured blue or red and each having either no child or precisely $2$ children), with one player allowed to move along monochromatic edges and the other along non-monochromatic edges, the draw probabilities equal $0$ unless every vertex gives birth to one blue and one red child. On bi-type Poisson trees where each vertex gives birth to Poisson$(lambda)$ offspring in total, the draw probabilities approach $1$ as $lambdaightarrowinfty$. We study such emph{novel} versions of normal, mis`{e}re and escape games on rooted multi-type Galton-Watson trees, with the "permissible" edges for one player being disjoint from those of her opponent. The probabilities of the games' outcomes are analyzed, compared with each other, and their behaviours as functions of the underlying law explored.

Recommendations

• scientific article; zbMATH DE number 3900780
• Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees
• Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees
• Games without repetitions on trees and multitrees
• Minimax functions on Galton-Watson trees

Cited in

(6)

• Disks on a Tree: Analysis of a Combinatorial Game
• Combinatorial games on Galton-Watson trees involving several-generation-jump moves
• scientific article; zbMATH DE number 2086645 (Why is no real title available?)
• The eigen-distribution of weighted game trees
• scientific article; zbMATH DE number 3900780 (Why is no real title available?)
• Galton–Watson games

This page was built for publication: Combinatorial games on multi-type Galton-Watson trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087633)