Related papers: On Ramsey properties, function spaces, and topolog…

We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In…

We establish that the existence of a winning strategy in certain topological games, closely related to a strong game of Choquet, played in a topological space $X$ and its hyperspace $K(X)$ of all nonempty compact subsets of $X$ equipped…

This article is a continuation of our investigations in the function space $C(X)$ with respect to the topology $\tau^s_\mathfrak{B}$ of strong uniform convergence on $\mathfrak{B}$ in line of (Chandra et al. 2020 \cite{dcpdsd} and Das et…

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

We study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of…

We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…

We define solution concepts appropriate for computationally bounded players playing a fixed finite game. To do so, we need to define what it means for a \emph{computational game}, which is a sequence of games that get larger in some…

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

Studying continuous time counterpart of some discrete time dynamics is now a standard and fruitful technique, as some properties hold in both setups. In game theory, this is usually done by considering differential games on Euclidean…

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…

We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The…

This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…

In this paper, we proved that a clopen version $S_1(C_O, C_O)$ of the Rothberger property and Borel strong measure zeroness are independent. For a zero-dimensional metric space $(X, d)$, $X$ satisfies $S_1(C_O, C_O)$ if, and only if, $X$…

We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game.…

Geuvers and Jacobs (LMCS 2021) formulated the notion of apartness relation on state-based systems modelled as coalgebras. In this context apartness is formally dual to bisimilarity, and gives an explicit proof system for showing that…

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…

Behavioral diversity, expert imitation, fairness, safety goals and others give rise to preferences in sequential decision making domains that do not decompose additively across time. We introduce the class of convex Markov games that allow…

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…