相关论文: The structure of Chip Firing Games and related mod…
By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well…
The Abelian sandpile growth model is a diffusion process for configurations of chips placed on vertices of the integer lattice $\mathbb{Z}^d$, in which sites with at least 2d chips {\em topple}, distributing 1 chip to each of their…
The formation of out-of-equilibrium patterns is a characteristic feature of spatially-extended, biodiverse, ecological systems. Intriguing examples are provided by cyclic competition of species, as metaphorically described by the…
Open-world survival games pose significant challenges for AI algorithms due to their multi-tasking, deep exploration, and goal prioritization requirements. Despite reinforcement learning (RL) being popular for solving games, its high sample…
We investigate Riemann-Roch theory for directed graphs. The Riemann-Roch criteria of Amini and Manjunath is generalized to all integer lattices orthogonal to some positive vector. Using generalized notions of a $v_0$-reduced divisor and…
We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…
The double slit experiment provides a clear demarcation between classical and quantum theory, while multi-slit experiments demarcate quantum and higher-order interference theories. In this work we show that these experiments pertain to a…
The swing lemma, due to G. Gr\"atzer for slim semimodular lattices and extended by G. Cz\'edli and G. Gr\"atzer for all planar semimodular lattices, describes the congruence generated by a prime interval in an efficient way. Here we present…
Machine learning relies on the assumption that unseen test instances of a classification problem follow the same distribution as observed training data. However, this principle can break down when machine learning is used to make important…
Chip firing provides a way to study the sandpile group (also known as the Jacobian) of a graph. We use a generalized version of chip firing to bound the number of invariant factors of the critical group of an arithmetical structure on a…
Several modifications of the famous mathematical Game of Life are introduced by making Game of Life rules stochastic and mutual influence of cells in their 8-neighborhood on a rectangular lattice spatially non-uniform. Results are reported…
We study how risk-sensitive players act in situations where the outcome is influenced not only by the state-action profile but also by the distribution of it. In such interactive decision-making problems, the classical mean-field game…
We present some elementary but foundational results concerning diamond-colored modular and distributive lattices and connect these structures to certain one-player combinatorial "move-minimizing games," in particular, a so-called "domino…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
Graphical chip-firing is a discrete dynamical system where chips are placed on the vertices of a graph and exchanged via simple firing moves. Recent work has sought to generalize chip-firing on graphs to higher dimensions, wherein graphs…
We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent…
With the success of modern machine learning, it is becoming increasingly important to understand and control how learning algorithms interact. Unfortunately, negative results from game theory show there is little hope of understanding or…
We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…
In classical Maker-Breaker games on graphs, Maker and Breaker take turns claiming edges; Maker's goal is to claim all of some structure (e.g., a spanning tree, Hamilton cycle, etc.), while Breaker aims to stop her. The standard question…
This paper deals with sliding games, which are a variant of the better known pushpush game. On a given structure (grid, torus...), a robot can move in a specific set of directions, and stops when it hits a block or boundary of the…