Related papers: Infinite games and chain conditions

We investigate whether an arbitrary base for a dense-in-itself topological space can be partitioned into two bases. We prove that every base for a T_3 Lindel\"of topology can be partitioned into two bases while there exists a consistent…

We prove that every surjective isometry between the unit spheres of two trace class spaces admits a unique extension to a surjective complex linear or conjugate linear isometry between the spaces. This provides a positive solution to…

This paper studies a system security problem in the context of observability based on a two-person noncooperative infinitely repeated game. Both the attacker and the defender have means to modify the dimension of the unobservable subspace,…

The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

We prove upper bounds for the spread, the Lindel\"of number and the weak Lindel\"of number of the $G_\delta$-topology on a topological space and apply a few of our bounds to give a short proof to a recent result of Juh\'asz and van Mill…

We show a parallel repetition theorem for the entangled value $\omega^*(G)$ of any two-player one-round game $G$ where the questions $(x,y) \in \mathcal{X}\times\mathcal{Y}$ to Alice and Bob are drawn from a product distribution on…

We prove, assuming Souslin's Hypothesis, that each uncountable subspace of each zero-dimensional monotonically normal compact space contains an uncountable subset of the real line with either the metric, the Sorgenfrey, or the discrete…

Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…

We discuss a sufficient condition for a space to be filled with an arbitrary finite number of self-similar spaces using a topological concept.

We investigate forms of filter extension properties in the two-cardinal setting involving filters on $P_\kappa(\lambda)$. We generalize the filter games introduced by Holy and Schlicht in \cite{HolySchlicht:HierarchyRamseyLikeCardinals} to…

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…

The (total) connected domination game on a graph $G$ is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices…

We present a simple and natural infinite game building an increasing chain of finite-dimensional Banach spaces. We show that one of the players has a strategy with the property that, no matter how the other player plays, the completion of…

We give tolerant testers with sublinear query complexity in the adjacency-list model for Unique Games. Prior tolerant testers required structural assumptions such as expansion or clusterability. For Unique Games, the tester distinguishes…

The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph $G$. Each vertex chosen must strictly increase the number of vertices…

We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $\varepsilon$-optimal (resp. optimal) strategies. These results depend on the size of…

The main goal of the paper is the full proof of a cardinal inequality for a space with points $G_\delta $, obtained with the help of a long version of the Menger game. This result, which improves a similar one of Scheepers and Tall, was…

We investigate a phenomenon of "one-to-two-player lifting" in infinite-duration two-player games on graphs with zero-sum objectives. More specifically, let $C$ be a class of strategies. It turns out that in many cases, to show that all…

We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…