Related papers: Hex implies Y
We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.
We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…
We explore a version of the minimax theorem for two-person win-lose games with infinitely many pure strategies. In the countable case, we give a combinatorial condition on the game which implies the minimax property. In the general case, we…
We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with…
The class of passable games was recently introduced by Selinger as a class of combinatorial games that are suitable for modelling monotone set coloring games such as Hex. In a monotone set coloring game, the players alternately color the…
The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization of this game, Weighted Arc Kayles (WAK for short), played on graphs with…
We develop an abstract axiomatic theory of tie-breaking. A tie-breaking input consists of a finite set N of players, a weak order on N representing the standings to be refined, and an auxiliary information item drawn from a set on which the…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…
In this expository note, we give a simple proof that a gambler repeating a game with positive expected value never goes broke with a positive probability. This does not immediately follow from the strong law of large numbers or other basic…
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
In this paper, we introduce several types of correspondences: weakly naturally quasiconvex, *-weakly naturally quasiconvex, weakly biconvex and correspondences with *--weakly convex graph and we prove some fixed point theorems for these…
From a geometric viewpoint, billiard trajectories and geodesics are related by mutual approximation results. In one direction, it is known that every geodesic curve in the boundary of a smooth convex body can be approximated by a sequence…
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…
The classical Birkhoff conjecture claims that the boundary of a strictly convex integrable billiard table is necessarily an ellipse (or a circle as a special case). In this article we prove a complete local version of this conjecture: a…
We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step,…
The game of Antonim is a variant of the game Nim, with the additional rule that heaps are not allowed to be the same size. A winning strategy for three heap Antonim has been solved. We will discuss the solution to three-heap Antonim and…
This paper provides a brief write-up showing that for any finite state game, a disjunctive number $x$ will eventually win that game. The proof techniques here are well known and this result follows immediately from folklore results in graph…
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a ``topological'' game for Multiplicative Additive Linear Logic without propositional variables, including cut moves. We recast the…