Related papers: Games in Banach spaces
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 Gleason-Kahane-\.Zelazko theorem states that a linear functional on a Banach algebra that is non-zero on invertible elements is necessarily a scalar multiple of a character. Recently this theorem has been extended to certain Banach…
We study nonzero-sum hypothesis testing games that arise in the context of adversarial classification, in both the Bayesian as well as the Neyman-Pearson frameworks. We first show that these games admit mixed strategy Nash equilibria, and…
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…
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…
Quasi-invariant and pseudo-differentiable measures on a Banach space $X$ over a non-Archimedean locally compact infinite field with a non-trivial valuation are defined and constructed. Measures are considered with values in $\bf R$.…
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…
Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space $\omega^\omega$. We consider such…
Using methods of descriptive set theory, in particular, the determinacy of infinite games of perfect information, we answer several questions from the literature regarding different notions of bases in Banach spaces and lattices. For the…
Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…
When optimization theorists consider optimization problems in infinite dimensional spaces, they need to deal with closed convex subsets(usually cones) which mostly have empty interior. These subsets often prevent optimization theorists from…
Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we…
We consider stochastic mean field games for which the state space is a network. In the ergodic case, they are described by a system coupling a Hamilton-Jacobi-Bellman equation and a Fokker-Planck equation, whose unknowns are the invariant…
This work introduces a new general approach for the numerical analysis of stable equilibria to second order mean field games systems in cases where the uniqueness of solutions may fail. For the sake of simplicity, we focus on a simple…
Answering one problem that has its origins in quantum mechanics, we prove that for any sequence $(A_n)_{n\in\mathbb N}$ of convex nowhere dense sets in a Banach space $X$ and any sequence $(\varepsilon_n)_{n=1}^\infty$ of positive real…
Generalizing a recent result on lineability of sets of non-injective linear operators, we prove, for quite general linear spaces $A$ of maps from an arbitraty set to a sequence space, that, for every $0 \neq f \in A$, the subset of $A$ of…
In this paper structure of infinite dimensional Banach spaces is studied by using an asymptotic approach based on stabilization at infinity of finite dimensional subspaces which appear everywhere far away. This leads to notions of…
Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for representing and analyzing games with possibly unaware…
The minimax theorem for zero-sum games is easily proved from the strong duality theorem of linear programming. For the converse direction, the standard proof by Dantzig (1951) is known to be incomplete. We explain and combine classical…
We study a particular class of mean field games whose solutions can be formally connected to a scalar transport equation on the Wasserstein space of measures. For this class, we construct some interesting explicit examples of non-uniqueness…