Related papers: Playing with Subshifts
We study a variant of the synchronization game on finite deterministic automata. In this game, Alice chooses one input letter of an automaton $A$ on each of her moves while Bob may respond with an arbitrary finite word over the input…
In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…
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…
Referential games and reconstruction games are the most common game types for studying emergent languages. We investigate how the type of the language game affects the emergent language in terms of: i) language compositionality and ii)…
We consider the permutation analogue of Penney's game for words. Two players, in order, each choose a permutation of length $k\ge3$; then a sequence of independent random values from a continuous distribution is generated, until the…
Traditionally, the formation of vocabularies has been studied by agent-based models (specially, the Naming Game) in which random pairs of agents negotiate word-meaning associations at each discrete time step. This paper proposes a first…
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a win. We explore and compare several criteria for establishing…
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…
We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker…
Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…
In this work we improve on a result from~\cite{GryKosZma15}. In particular, we investigate the situation where a word is constructed jointly by two players who alternately append letters to the end of an existing word. One of the players…
Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…
Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…
Human conversations can evolve in many different ways, creating challenges for automatic understanding and summarization. Goal-oriented conversations often have meaningful sub-dialogue structure, but it can be highly domain-dependent. This…
We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a…
Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeucht-Fraisse (EF) games in two ways: first, MS games are…
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vertex is the winner. The game fits into the scheme of several…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…
In classical Maker-Breaker games on graphs, Maker and Breaker take turns claiming edges; Maker's goal is to claim all of some structure (e.g., a spanning tree, Hamilton cycle, etc.), while Breaker aims to stop her. The standard question…