Related papers: Telgarsky's conjecture may fail

Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…

We introduce an affine version of Tic-Tac-Toe played on the finite affine space $\mathbb{F}_q^m$. Two players alternately claim points, and the first player to occupy all points of an affine subspace of dimension $n$ wins. We call this the…

In 1947, M. S. Macphail constructed a series in $\ell_{1}$ that converges unconditionally but does not converge absolutely. According to the literature, this result helped Dvoretzky and Rogers to finally answer a long standing problem of…

A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of…

We construct a finite deterministic graphical (DG) game without Nash equilibria in pure stationary strategies. This game has 3 players $I=\{1,2,3\}$ and 5 outcomes: 2 terminal $a_1$ and $a_2$ and 3 cyclic. Furthermore, for 2 players a…

For every well founded tree $\mathcal{T}$ having a unique root such that every non-maximal node of it has countable infinitely many immediate successors, we construct a $\mathcal{L}_\infty$-space $X_{\mathcal{T}}$. We prove that for each…

We know that the Nash equilibria of a game cannot be computed efficiently unless $P = PPAD$. But can they be learned? Are there dynamics that (1) can be computed efficiently by the players at each strategy profile and (2) are guaranteed to…

Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each…

The $(m,b)$ Maker-Breaker percolation game on $(\mathbb{Z}^2)_p$, introduced by Day and Falgas-Ravry, is played in the following way. Before the game starts, each edge of $\mathbb{Z}^2$ is removed independently with probability $1-p$. After…

In this paper we consider strong Nash equilibria, in mixed strategies, for finite games. Any strong Nash equilibrium outcome is Pareto efficient for each coalition. First, we analyze the two--player setting. Our main result, in its simplest…

The classical Banach--Mazur theorem asserts that every separable Banach space admits an isometric embedding into $C[0,1]$. It is also well known that every separable Banach space embeds isometrically into $\ell^\infty$. We show that such an…

In this paper we present a simple proof of Gowers Dichotomy which states that every infinite dimensional Banach Space has a subspace which either contains an unconditional basic sequence or is hereditarily indecomposable. Our approach is…

In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is…

Let $X$ be a real Banach space and let $Y \subseteq X^*$ be a linear subspace having the Orlicz-Thomas property, that is, for each $\sigma$-algebra $\Sigma$ and for each map $\nu:\Sigma\to X$, the countable additivity of the composition…

Being motivated by the famous Kaplansky theorem we study various sequential properties of a Banach space $E$ and its closed unit ball $B$, both endowed with the weak topology of $E$. We show that $B$ has the Pytkeev property if and only if…

In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $\left(\varphi_1, \varphi_2\right)-$convex function $g, $ with arbitrarily small norm, such that $f + g…

Toral introduced so-called cooperative Parrondo games, in which there are N players (3 or more) arranged in a circle. At each turn one player is randomly chosen to play. He plays either game A or game B, depending on the strategy. Game A…

The use of monotonicity and Tarski's theorem in existence proofs of equilibria is very widespread in economics, while Tarski's theorem is also often used for similar purposes in the context of verification. However, there has been…

Let $\mathcal{P}$ be a class of Banach spaces and let $T=\{T_\alpha\}_{\alpha\in A}$ be a set of metric spaces. We say that $T$ is a set of {\it test-spaces} for $\mathcal{P}$ if the following two conditions are equivalent: (1)…

In this paper we deal with those Banach spaces $Z$ which satisfy the Mazur--Ulam property, namely that every surjective isometry $\Delta$ from the unit sphere of $Z$ to the unit sphere of any Banach space $Y$ admits an unique extension to a…