Related papers: On sequences arising from randomizing subtraction …

Let S be a topological property of sequences (such as, for example, "to contain a convergent subsequence" or "to have an accumulation point"). We introduce the following open-point game OP(X,S) on a topological space X. In the n'th move,…

We propose a new model of provenance, based on a game-theoretic approach to query evaluation. First, we study games G in their own right, and ask how to explain that a position x in G is won, lost, or drawn. The resulting notion of game…

We study the following game. Three players start with initial capitals of $s_{1},s_{2},s_{3}$ dollars; in each round player $P_{m}$ is selected with probability $\frac{1}{3}$; then \emph{he} selects player $P_{n}$ and they play a game in…

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…

We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…

Social dilemmas concern a natural conflict between cooperation and self interests among individuals in large populations. The emergence of cooperation and its maintenance is the key for the understanding of fundamental concepts about the…

Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two…

We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.

We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…

Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…

This paper extends the work done by Angela Siegel on subtraction games in which the subtraction set is N \ X for some finite set X. Siegel proves that for any finite set X, the G-sequence is ultimately arithmetic periodic, and that if |X| =…

We consider a subtraction Nim with subtraction set {s_1,s_2,s_3={2,4n,4n+2}, where n is a positive integer such that n >= 3. We do not treat the case that n=1 or n=2 in this article. We show that this game satisfies the reverse-mex property…

Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…

We propose a classification of all one-dimensional discrete statistical models with maximum likelihood degree one based on their rational parametrization. We show how all such models can be constructed from members of a smaller class of…

We explore the cycle types of a class of biased random derangements, described as a random game played by some children labeled $1,\cdots,n$. Children join the game one by one, in a random order, and randomly form some circles of size at…

Rejection sampling is a popular method used to generate numbers that follow some given distribution. We study the use of this method to generate random numbers in the unit interval from increasing probability density functions. We focus on…

(Note. The results of this manuscript has been merged and published with another paper of the same authors: A new approach to nonrepetitve sequences.) A repetition of size $h$ ($h\geqslant1$) in a given sequence is a subsequence of…

We study a class of algebras we regard as generalized Rock-Paper-Scissors games. We determine when such algebras can exist, show that these algebras generate the varieties generated by hypertournament algebras, count these algebras, study…

We study stochastic differential games with $N$ players, where interactions are determined by sequences of graphs in which the number of neighbours of each node remains bounded as $N$ grows, such as chain graphs or lattices. Our main goal…