Related papers: A position in infinite chess with game value $\ome…
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
We describe some forms with greater Waring rank than previous examples. In $3$ variables we give forms of odd degree with strictly greater rank than the ranks of monomials, the previously highest known rank. This narrows the possible range…
The game of war is one of the most popular international children's card games. In the beginning of the game, the pack is split into two parts, then on each move the players reveal their top cards. The player having the highest card…
In this paper, we investigate the existence and characterization of the value for a two-player zero-sum differential game with symmetric incomplete information on a continuum of initial positions and with signal revelation. Before the game…
We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.
For a mean field game model with a major and infinite minor players, we characterize a notion of Nash equilibrium via a system of so-called master equations, namely a system of nonlinear transport equations in the space of measures. Then,…
Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite…
We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real $\epsilon$, let us call a stochastic game $\epsilon$-ergodic, if its values from any two initial…
We propose a new framework of Markov $\alpha$-potential games to study Markov games. We show that any Markov game with finite-state and finite-action is a Markov $\alpha$-potential game, and establish the existence of an associated…
We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal $\omega$. Four natural formulations are presented and their relative strengths are compared. In the analysis of the pigeonhole principle for…
In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…
In this paper the set of value functions of all-possible zero-sum differential games with terminal payoff is characterized. The necessary and sufficient condition for a given function to be a value of some differential game with terminal…
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in…
For zero-sum two-player continuous-time games with integral payoff and incomplete information on one side, one shows that the optimal strategy of the informed player can be computed through an auxiliary optimization problem over some…
We propose a new dynamics for equilibrium selection of finite player discrete strategy games. The dynamics is motivated by optimal transportation, and models individual players' myopicity, greedy and uncertainty when making decisions. The…
In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…
We introduce new cardinal invariants of a poset, called the comparability number and the incomparability number. We determine their value for well-known posets, such as $\omega^\omega$, $\mathcal{P}(\omega)/\mathrm{fin}$, the Turing degrees…
In this paper we introduce the inaccessible game, an information-theoretic dynamical system constructed from four axioms. The first three axioms are known and define \emph{information loss} in the system. The fourth is a novel…
A game has approximate equilibria if for every $\epsilon >0$ there is an $\epsilon$-equilibrium. We show that there is a stochastic game that lacks approximate equilibria. This game has finitely many players and actions, their payoffs are…
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…