Related papers: The Generalized Bergman Game

It is shown that, for every integer n>2, there exists \delta_{n}>0 such that the closure of the set of the real parts of the zeros of the nth partial sum of the Riemann zeta function \zeta_{n} contains to the interval [-\delta_{n},b^{n}].…

We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables…

Motivated by the burning and cooling processes, the burning game is introduced. The game is played on a graph $G$ by the two players (Burner and Staller) that take turns selecting vertices of $G$ to burn; as in the burning process, burning…

The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…

Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b-matchings, for a vertex capacity vector $b \leq 2$. We show how to separate over the core of 2-matching…

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $G=(V,E)$ and a set of fair moves $E_f\subseteq E$ a player is said to play "fair" in…

In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we…

In this paper we consider symmetric games where a large number of players can be in any one of d states. We derive a limiting mean field model and characterize its main properties. This mean field limit is a system of coupled ordinary…

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call…

Bewley and Kohlberg (1976) and Mertens and Neyman (1981) have proved, respectively, the existence of the asymptotic value and the uniform value in zero-sum stochastic games with finite state space and finite action sets. In their work, the…

This article deals with classes of antagonistic games with two players. A game is specified in terms of two `hostile' stochastic processes representing mutual attacks upon random times exerting casualties of random magnitudes. The game ends…

We prove that chess played on the infinite chessboard $\mathbb{Z}^2$ with infinitely many pieces is as powerful as it could possibly be, by showing that every open Gale-Stewart game with draws is strategically equivalent to some infinite…

The Gale-Berlekamp switching game is played on the following device: $G_n=\{1,2,\ldots,n\} \times \{1,2,\ldots,n\}$ is an $n \times n$ array of lights is controlled by $2n$ switches, one for each row or column. Given an (arbitrary) initial…

We show that all negative powers B_{a,b}^-{s} of the Beta distribution are infinitely divisible. The case b<1 follows by complete monotonicity, the case b > 1, s > 1 by hyperbolically complete monotonicity and the case b > 1, s < 1 by a…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ which leaves invariant each…

We define a game semantics for second order classical arithmetic PA2 (with quantifiers over predicates on integers and full comprehension axiom). Our semantics is effective: moves are described by a finite amount of information and whenever…

n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…