Related papers: Galton-Watson games
We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with $Poisson(c)$ offspring distribution. Fixing a positive integer $k$, we exploit the $k$-move Ehrenfeucht game on rooted trees for this…
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…
We investigate the dynamics of a conservative version of Conway's Game of Life, in which a pair consisting of a dead and a living cell can switch their states following Conway's rules but only by swapping their positions, irrespective of…
We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…
In the classical leader election procedure all players toss coins independently and those who get tails leave the game, while those who get heads move to the next round where the procedure is repeated. We investigate a generalizion of this…
Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…
Interacting particle systems of interest in evolutionary game theory introduced in the probability literature consist of variants of the voter model in which each site is occupied by one player. The goal of this paper is to initiate the…
We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…
The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…
The concept of intransitiveness for games, which is the condition for which there is no first-player winning strategy can arise surprisingly, as happens in the Penney game, an extension of the heads or tails. Since a game can be converted…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…
In this note we discuss a theory of combinatorial games that involve transmitting the moves through a noisy channel that can introduce errors during the transmission. Players are aware of this interference and incorporate this variable into…
We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
Gambits are central to human decision-making. Our goal is to provide a theory of Gambits. A Gambit is a combination of psychological and technical factors designed to disrupt predictable play. Chess provides an environment to study gambits…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of $N$ players on complete graphs with $k$ players having a possibility of changing their strategies at each time moment called $k$-flip Ising game is…
We study an extension of the so-called defective Galton-Watson processes obtained by allowing the offspring distribution to change over the generations. Thus, in these processes, the individuals reproduce independently of the others and in…