Related papers: Hydra games for recursively Mahlo operations
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…
In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase the player's odds.…
We describe the Coxeter permutahedra, recently studied by Ardila, Castillo, Eur and Postnikov, in terms of random Coxeter tournaments, which involve cooperative and solitaire games, as well as the usual competitive games in graph…
Traditional solvable game theory and mean-field-type game theory (risk-aware games) predominantly focus on quadratic costs due to their analytical tractability. Nevertheless, they often fail to capture critical non-linearities inherent in…
Finite horizon Sinai billiard maps are examples of uniformly hyperbolic systems with singularities. These discontinuities make it more difficult to develop the classical theory of thermodynamic formalism. Nevertheless, Baladi and Demers…
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-play are coevolutionary algorithms (CoEAs). However, the…
We present exact analytic results for a new version of the Minority Game (MG) in which strategy performance is recorded over a finite time horizon. The dynamics of this Time Horizon Minority Game (THMG) exhibit many distinct features from…
A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…
In this paper a hierarchical extension of the Minority Game is defined and studied. Numerical simulations show a special type of emergent global behavior between separated parts of the hierarchical structure, connected only through a…
In communication systems where users share common resources, users' selfish behavior usually results in suboptimal resource utilization. There have been extensive works that model communication systems with selfish users as one-shot games…
The outcome of many social and economic interactions, such as stock-market transactions, is strongly determined by the predictions that agents make about the behavior of other individuals. Cognitive Hierarchy Theory provides a framework to…
A notion of incentive for agents is introduced which leads to a very general notion of an equilibrium for a finite game. Sufficient conditions for the existence of these equilibria are given. Known existence theorems are shown to be…
We introduce a deterministic analogue of Markov chains that we call the hunger game. Like rotor-routing, the hunger game deterministically mimics the behavior of both recurrent Markov chains and absorbing Markov chains. In the case of…
In this paper we consider an infinite horizon zero-sum differential game where the dynamics of each player and the running cost are also depending on the evolution of some discrete (switching) variables. In particular, such switching…
We investigate the value of parallel repetition of one-round games with any number of players $k\ge 2$. It has been an open question whether an analogue of Raz's Parallel Repetition Theorem holds for games with more than two players, i.e.,…
We present an implementation of Smoothed Particle Hydrodynamics (SPH) in an adaptive-mesh PPPM algorithm. The code evolves a mixture of purely gravitational particles and gas particles. The code retains the desirable properties of previous…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
We consider $N$-player games, in continuous time, finite state space and finite time horizon, on a geometrical structure possessing a macroscopic limit in a suitable sense. This geometrical structure breaks the permutation invariance…
We define and study the harmonic heat flow for almost complex structures which are compatible with a Riemannian structure $(M, g)$. This is a tensor-valued version of harmonic map heat flow. We prove that if the initial almost complex…