Related papers: Telgarsky's conjecture may fail

In Problem #1542 of Mathematics Magazine, Grossman and Turett define the Cantor game. In his 2007 Mathematics Magazine article about the Cantor game, Matt Baker proves several results and poses three challenging questions about it: Do there…

Menger's conjecture that Menger spaces are /sigma-compact is false; it is true for analytic subspaces of Polish spaces and undecidable for more complex definable subspaces of Polish spaces. For non-metrizable spaces, analytic Menger spaces…

In this paper we prove that if $f$ is a self-mapping of a nonempty subset $K$ of a normed space $X$ that satisfies some mild conditions, then the minimal displacement of large iterations $f^n$ always dominates that of $f$ along certain…

This paper generalizes the Fan-Knaster-Kuratowski-Mazurkiewicz (FKKM) lemma to the case of weak topology, and obtains the Ky Fan minimax inequality defined on non-empty non-compact convex subsets in reflexive Banach spaces, then we apply it…

For a positive integer $k$ we consider the $k$-vertex-connectivity game, played on the edge set of $K_n$, the complete graph on $n$ vertices. We first study the Maker-Breaker version of this game and prove that, for any integer $k \geq 2$…

Let $X$ be a Banach space and $(f_n)_n$ be a bounded sequence in $L^1(X)$. We prove a complemented version of the celebrated Talagrand's dichotomy i.e we show that if $(e_n)_n$ denotes the unit vector basis of $c_0$, there exists a sequence…

In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two possible orientations. Before the game starts, Breaker fixes…

We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward…

We study two-player positional games where Maker and Breaker take turns to select a previously unoccupied number in $\{1,2,\ldots,n\}$. Maker wins if the numbers selected by Maker contain a solution to the equation \[…

We show that, by using multiplicative weights in a game-theoretic thought experiment (and an important convexity result on the composition of multiplicative weights with the relative entropy function), a symmetric bimatrix game (that is, a…

We study the existence of continuity points for mappings $f: X\times Y\to Z$ whose $x$-sections $Y\ni y\to f(x,y)\in Z$ are fragmentable and $y$-sections $X\ni x\to f(x,y)\in Z$ are quasicontinuous, where $X$ is a Baire space and $Z$ is a…

We consider certain strengthenings of property (T) relative to Banach spaces that are satisfied by high rank Lie groups. Let X be a Banach space for which, for all k, the Banach--Mazur distance to a Hilbert space of all k-dimensional…

We prove that for any constant $k$ and any $\epsilon<1$, there exist bimatrix win-lose games for which every $\epsilon$-WSNE requires supports of cardinality greater than $k$. To do this, we provide a graph-theoretic characterization of…

We study the abstract Banach-Mazur game played with finitely generated structures instead of open sets. We characterize the existence of winning strategies aiming at a single countably generated structure. We also introduce the concept of…

We prove that a Tychonoff space $X$ is an Ascoli space (resp., a sequentially Ascoli space) if and only if for each Banach space $E$, every $k$-continuous and almost $k$-compact (resp., almost $k$-sequential) map $T$ form $X$ into the…

Von Neumann's Min-Max Theorem guarantees that each player of a zero-sum matrix game has an optimal mixed strategy. This paper gives an elementary proof that each player has a near-optimal mixed strategy that chooses uniformly at random from…

In a companion paper (Studia Math., 2023), we proved for every $\lambda\in(1,2]$ the existence of a $(\lambda^+)$-injective renorming of $\ell_\infty$ that is not $\lambda$-injective, thereby establishing a~forgotten theorem of…

We prove the almost equivalence of the minimax theorem and the strong duality theorem for a large class of games and conic programs. The previous fundamental results on the equivalence of linear programming and two-player zero-sum games…

A new hierarchy of Banach spaces $T_k(d,\theta)$, $k$ any positive integer, is constructed using barriers in high dimensional Ellentuck spaces \cite{DobrinenJSL15} following the classical framework under which a Tsirelson type norm is…

We show that the set of numbers with bounded L\"uroth expansions (or bounded L\"uroth series) is winning and strong winning. From either winning property, it immediately follows that the set is dense, has full Hausdorff dimension, and…