Related papers: Translation Results for some Selection Games with …
We present a unified approach, based on dominating families in binary relations, for the study of topological properties defined in terms of selection principles and the games associated to them.
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model…
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…
Many emerging applications - such as adversarial training, AI alignment, and robust optimization - can be framed as zero-sum games between neural nets, with von Neumann-Nash equilibria (NE) capturing the desirable system behavior. While…
In this article, we introduce certain kinds of computable reduction games with imperfect information. One can view such a game as an extension of the notion of Turing reduction, and generalized Weihrauch reduction as well. Based on the work…
Let X be a Tychonoff space and MC(X) be the space of convex minimal usco maps with values in R, the space of real numbers. Such set-valued maps are important in the study of subdifferentials of convex functions. Using the strong Choquet…
The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in $NP \cap coNP$ which are not known to be in $P$. However, there are some…
In this paper, we study an interplay between local and global properties of spaces of minimal usco maps equipped with the topology of uniform convergence on compact sets. In particular, for each locally compact space $X$ and metric space…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…
Min-max optimization problems (i.e., min-max games) have been attracting a great deal of attention because of their applicability to a wide range of machine learning problems. Although significant progress has been made recently, the…
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…
We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. Second we formally introduce and define the CP-games…
This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…
We consider time-dependent viscous Mean-Field Games systems in the case of local, decreasing and unbounded coupling. These systems arise in mean-field game theory, and describe Nash equilibria of games with a large number of agents aiming…
The two main results of this work are the following: if a space $X$ is such that player II has a winning strategy in the game $\gone(\Omega_x, \Omega_x)$ for every $x \in X$, then $X$ is productively countably tight. On the other hand, if a…
This work presents the selection principle $S_1^*(\tau_x,CD)$ that characterizes $q$-points. We also discuss the induced topological game $G_1^*(\tau_x,CD)$ and its relations with $W$-points and $\widetilde{W}$-points, as well as with the…
In this note we study the open-point topological games in order to analyze the least upper bound for density of dense subsets of a topological space. This way we may also analyze the behavior of such cardinal invariants in taking products…
Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…