相关论文: The angel wins

Wythoff's Game is a game for two players playing alternately on two stacks of tiles. On her turn, a player can either remove a positive number of tiles from one stack, or remove an equal positive number of tiles from both stacks. The last…

This paper considers the blocking or football pursuit-evasion differential game. Two pursuers cooperate and try to capture the ball carrying evader as far as possible from the goal line. The evader wishes to be as close as possible to the…

The balance game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of $G$. Admirable labels the selected vertices by $0$ and Impish by $1$, and the resulting label on any edge…

We consider the following two-player game played on a separable, infinite-dimensional Banach space X. Player S chooses a positive integer k_1 and a finite-codimensional subspace X_1 of X. Then player P chooses x_1 in the unit sphere of X_1.…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

Consider the following one-player game played on an initially empty graph with $n$ vertices. At each stage a randomly selected new edge is added and the player must immediately color the edge with one of $r$ available colors. Her objective…

In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforcer wins if Avoider claims all vertices of an edge; Avoider…

We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his…

The devil's staircase is a term used to describe surface or an equilibrium phase diagram in which various ordered facets or phases are infinitely closely packed as a function of some model parameter. A classic example is a 1-D Ising model…

We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on vertices of the graph; the game then proceeds in turns between…

A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the general position achievement game. The game is played on a…

We consider a two-player game in which the first player (the Guesser) tries to guess, edge-by-edge, the path that second player (the Chooser) takes through a directed graph. At each step, the Guesser makes a wager as to the correctness of…

A neat question involving coin flips surfaced on $\Bbb X$, and generated an intensive `storm' of `social mathematics'. In a sequence of flips of a fair coin, Alice wins a point at each appearance of two consecutive heads, and Bob wins a…

N point particles move within a billiard table made of two circular cavities connected by a straight channel. The usual billiard dynamics is modified so that it remains deterministic, phase space volumes preserving and time reversal…

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…

In a zero-sum stochastic game, at each stage, two adversary players take decisions and receive a stage payoff determined by them and by a controlled random variable representing the state of nature. The total payoff is the normalized…

Consider the following game played by two players, called Waiter and Client, on the edges of $K_n$ (where $n$ is divisible by $3$). Initially, all the edges are unclaimed. In each round, Waiter picks two yet unclaimed edges. Client then…

Let $a$, $b$, and $n$ be integers with $0<a<b<n$. In a certain two-player probabilistic chip-collecting game, Alice tosses a coin to determine whether she collects $a$ chips or $b$ chips. If Alice collects $a$ chips, then Bob collects $b$…

Traditional coding theory guarantees valid decoding only if a minority of symbols are adversarially manipulated. In contrast, the game of coding framework ensures reliable decoding, even in the presence of an adversarial majority. This…

Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this to create a two-player game. Given a fixed integer $n$ and an initial decomposition of $n = n F_1$, the two…