Combinatorial games on multi-type Galton-Watson trees
zbMATH Open1490.60027arXiv2103.08474MaRDI QIDQ5087633FDOQ5087633
Authors: Moumanti Podder
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2103.08474
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
fixed pointsnormalmulti-type Galton-Watson treesbi-type binary treesbi-type Poisson treesmisère and escape gamestwo-player combinatorial games
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)
Cited In (4)
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)