Related papers: Banach-Mazur game and open mapping theorem
Known results are reviewed about the bounded and convex bounded variants, bT and cbT, of a topology T on a real Banach space. The focus is on the cases of T = w(P*, P) and of T = m(P*, P), which are the weak* and the Mackey topologies on a…
We present a class of mappings between models with topological mass mechanism and purely topological models in arbitrary dimensions. These mappings are established by directly mapping the fields of one model in terms of the fields of the…
In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed…
We study a version of the stochastic "tug-of-war" game, played on graphs and smooth domains, with the empty set of terminal states. We prove that, when the running payoff function is shifted by an appropriate constant, the values of the…
We investigate multiple variants of the game Cops and Robbers. Playing it on an $n \times n$ toroidal chess graph, the game is varied by defining moves for cops and robbers differently, always mimicking moves of certain chess pieces. In…
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different…
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…
We describe a new approach to the problem of constructing gluing parameterizations for open neighborhoods of boundary points of moduli spaces of anti-self-dual connections over closed four-dimensional manifolds. Our approach employs general…
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…
We prove a generalized implicit function theorem for Banach spaces, without the usual assumption that the subspaces involved being complemented. Then we apply it to the problem of parametrization of fibers of differentiable maps, the Lie…
The basic Monty Hall problem is explored to introduce into the fundamental concepts of the game theory and to give a complete Bayesian and a (noncooperative) game-theoretic analysis of the situation. Simple combinatorial arguments are used…
We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankwidth. Our proof uses a game-theoretic approach and has the…
The main purpose of this paper is to develop some methods to investigate the Schwarz type lemmas of holomorphic mappings and pluriharmonic mappings in Banach spaces. Initially, we extend the classical Schwarz lemmas of holomorphic mappings…
We give a stochastic generalization of transport theorem on smooth manifold. Furthermore, we deduce a system of continuity equation and present some application on torus.
We show that a fairly arbitrary Frechet space topology on the space of holomorphic functions on a domain controls the topology of uniform convergence on compact sets. In fact it turns out that the result we present can be proved more simply…
The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found on the linear-time/branching-time spectrum, over general system types. We describe a generic…
We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings.…
In this paper, we generalize modal $\mu$-calculus to the non-distributive (lattice-based) modal $\mu$-calculus and formalize some scenarios regarding categorization using it. We also provide a game semantics for the developed logic. The…
In this paper we study connections between topological games such as Rothberger, Menger and compact-open, and relate these games to properties involving covers by G_{\delta} subsets. The results include: (1) If Two has a winning strategy in…
The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper…