Related papers: Schmidt Games and Conditions on Resonant Sets
Here we will use results of Cox, Durrett, and Perkins for voter model perturbations to study spatial evolutionary games on $Z^d$, $d\ge 3$ when the interaction kernel is finite range, symmetric, and has covariance matrix $\sigma^2I$. The…
In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker…
We study infinite asymptotic games in Banach spaces with an F.D.D. and prove that analytic games are determined by characterising precisely the conditions for the players to have winning strategies. These results are applied to characterise…
The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…
In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…
The pursuit-evasion game with two persons is considered. Both players are moving in a metric space, have equal maximum speeds and complete information about the location of each other. We study the sufficient conditions for a capture (with…
In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…
We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…
Bayesian regression games are a special class of two-player general-sum Bayesian games in which the learner is partially informed about the adversary's objective through a Bayesian prior. This formulation captures the uncertainty in regard…
Determining a Nash equilibrium in a $2$-player non-zero sum game is known to be PPAD-hard (Chen and Deng (2006), Chen, Deng and Teng (2009)). The problem, even when restricted to win-lose bimatrix games, remains PPAD-hard (Abbott, Kane and…
In this paper we study second order stationary Mean Field Game systems under density constraints on a bounded domain $\Omega \subset \mathbb{R}^d$. We show the existence of weak solutions for power-like Hamiltonians with arbitrary order of…
In set theory without the axiom of regularity, we consider a game in which two players choose in turn an element of a given set, an element of this element, etc.; a player wins if its adversary cannot make any next move. Sets that are…
We consider evolutionary dynamics for population games in which players have a continuum of strategies at their disposal. Models in this setting amount to infinite-dimensional differential equations evolving on the manifold of probability…
We call a badly approximable number $decaying$ if, roughly, the Lagrange constants of integer multiples of that number decay as fast as possible. In this terminology, a question of Y. Bugeaud ('15) asks to find the Hausdorff dimension of…
In a beta-transformation (for integer beta) or a Gauss map system, given a sequence of functions fn from [0,1] to itself, consider the collection of points in [0,1] whose nth iteration under the map is distanced away from its value under…
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose…
We study a class of evolutionary game dynamics defined by balancing a gain determined by the game's payoffs against a cost of motion that captures the difficulty with which the population moves between states. Costs of motion are…
Can vectors with low Schmidt rank form mutually unbiased bases? Can vectors with high Schmidt rank form positive under partial transpose states? In this work, we address these questions by presenting several new results related to Schmidt…
In this paper we prove almost sure convergence to the ball, in the Nikodym metric, of sequences of random Steiner symmetrizations of bounded Caccioppoli and bounded measurable sets, paralleling a result due to Mani-Levitska concerning…