Related papers: A Variant $\beta$-Wythoff Nim on Beatty's Theorem
Petri games are a multi-player game model for the automatic synthesis of distributed systems, where the players are represented as tokens on a Petri net and are grouped into environment players and system players. As long as the players…
We study quitting games and define the concept of absorption paths, which is an alternative definition to strategy profiles that accomodates both discrete time aspects and continuous time aspects, and is parameterized by the total…
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
Whitham modulation theory for the two dimensional Benjamin-Ono (2DBO) equation is presented. A system of five quasi-linear first-order partial differential equations is derived. The system describes modulations of the traveling wave…
We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…
We prove that the set of bounded geodesics in Teichmuller space are a winning set for Schmidt's game. This is a notion of largeness in a metric space that can apply to measure 0 and meager sets. We prove analogous closely related results on…
In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…
Necessary and sufficient conditions are presented for several families of planar curves to form a set of stable sampling for the Bernstein space $\mathcal{B}_{\Omega}$ over a convex set $\Omega \subset \mathbb{R}^2$. These conditions…
We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…
We prove that for any countable set $A$ of real numbers, the set of binary indefinite quadratic forms $Q$ such that the closure of $Q(\mathbb{Z}^2)$ is disjoint from $A$ has full Hausdorff dimension.
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph ${\mathcal G}(n,p)$. In each round of the $(1 : q)$ Waiter-Client Hamiltonicity game, the first player,…
In this note we prove a Birkhoff type transitivity theorem for continuous maps acting on non-separable completely metrizable spaces and we give some applications for dynamics of bounded linear operators acting on complex Fr\'{e}chet spaces.…
Let A and B be two first order structures of the same relational vocabulary L. The Ehrenfeucht-Fraisse-game of length gamma of A and B denoted by EFG_gamma(A,B) is defined as follows: There are two players called for all and exists. First…
The complement of a complex hyperplane arrangement is known to be homotopic to a minimal CW complex. There are several approaches to the minimality. In this paper, we restrict our attention to real two dimensional cases, and introduce the…
The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…
We introduce a problem set-up we call the Iterated Matching Pennies (IMP) game and show that it is a powerful framework for the study of three problems: adversarial learnability, conventional (i.e., non-adversarial) learnability and…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…