Related papers: An exact Ramsey principle for block sequences
We study the Ramsey property for vector spaces over finite fields with bilinear forms. We prove that symplectic spaces over finite fields do not have the Ramsey property. We also describe vector spaces with skew symmetric bilinear forms and…
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…
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…
We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…
We give a self-contained and elementary proof for boundedness, existence, and uniqueness of solutions to dynamic programming principles (DPP) for biased tug-of-war games with running costs. The domain we work in is very general, and as a…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
A fundamental open problem in monotone game theory is the computation of a specific generalized Nash equilibrium (GNE) among all the available ones, e.g. the optimal equilibrium with respect to a system-level objective. The existing GNE…
We use the repeated averages hierarchy to prove a Ramsey theorem regarding uniform upper estimates of convex block sequences of weakly null sequences. The base case of the theorem recovers a result of Freeman.
Given a target set $A\subseteq \mathbb{R}^d$ and a real number $\beta\in (0,1)$, McMullen introduced the notion of $A$ being an absolutely $\beta$-winning set. This involves a two player game which we call the $\beta$-McMullen game. We…
In this paper, we present an optimal control problem for stochastic differential games under Markov regime-switching forward-backward stochastic differential equations with jumps and partial information. First, we prove a sufficient maximum…
This paper is purposed to exploit prevalent premises for determining analytical solutions to differential equations formulated from the calculus of variations. we realize this premises from the statement of Emmy Noether's theorem; that…
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Lov\'asz Local Lemma which can dramatically reduce the number of edges needed in…
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…
In this paper we study the problem of the existence of a least-action principle for invertible, second-order dynamical systems, discrete in time and space. We show that, when the configuration space is finite, a least-action principle does…
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,…
Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…
We examine a version of Ramsey's theorem based on Tao, Gaspar and Kohlenbach's "finitary" infinite pigeonhole principle.We will show that the "finitary" infinite Ramsey's theorem naturally gives rise to statements at the level of the…
For two-person dynamic zero-sum games (both discrete and continuous settings), we investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity and the limit of value…