Related papers: An exact Ramsey principle for block sequences

In this paper we prove a strong maximum principle for certain parabolic systems of equations. In particular, our methods place no restriction on the regularity of the boundary of the convex set in which the system takes its values, and…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed…

By using the asymptotic theory of Pemantle and Wilson, exact asymptotic expansions of the free energy of the monomer-dimer model on rectangular $n \times \infty$ lattices in terms of dimer density are obtained for small values of $n$, at…

Expanding the ideas of the author's paper 'Nonexpansive maps and option pricing theory' (Kibernetica 34:6 (1998), 713-724) we develop a pure game-theoretic approach to option pricing, by-passing stochastic modeling. Risk neutral…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We…

In this paper we characterise the long-run behaviour of the replicator dynamic in zero-sum games (symmetric or non-symmetric). Specifically, we prove that every zero-sum game possesses a unique global replicator attractor, which we then…

We introduce and analyze a new finite-difference scheme, relying on the theta-method, for solving monotone second-order mean field games. These games consist of a coupled system of the Fokker-Planck and the Hamilton-Jacobi-Bellman equation.…

We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the…

This paper investigates the asymptotic behaviour of solutions to certain infinite systems of ordinary differential equations. In particular, we use results from ergodic theory and the asymptotic theory of $C_0$-semigroups to obtain a…

We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an oracle, evaluating the dynamic programming operator up to…

We consider a general nonzero-sum impulse game with two players. The main mathematical contribution of the paper is a verification theorem which provides, under some regularity conditions, a suitable system of quasi-variational inequalities…

We prove that for a class of zero-sum differential games with incomplete information on both sides, the value admits a probabilistic representation as the value of a zero-sum stochastic differential game with complete information, where…

We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation with block-allocated storage through soundness, finite…

We prove a vector-valued almost sure invariance principle for some classes of time dependent non-uniformly distance expanding dynamical systems. The models we have in mind are certain sequential versions of the smooth non-uniformly distance…

We generalize the results of Fleming and Souganidis (1989) on zero sum stochastic differential games to the case when the controls are unbounded. We do this by proving a dynamic programming principle using a covering argument instead of…

We prove a nonlinear regularity principle in sequence spaces which produces universal estimates for special series defined therein. Some consequences are obtained and, in particular, we establish new inclusion theorems for multiple summing…