Related papers: Invariant games and non-homogeneous Beatty sequenc…
(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 infinite words coding an orbit under an exchange of three intervals which have full complexity $\C(n)=2n+1$ for all $n\in\N$ (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the…
We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge of the suffix of the input word still to be read. We show…
We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their…
Bargmann invariants, multivariate traces of states, completely characterize any unitary-invariant property of a set of states. Unitary invariants enable the description of quantum resources such as basis-independent coherence and…
Let $\alpha$ and $\beta$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n \alpha + \beta \rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
We develop a theory of combinatorial games that is appropriate for describing positions in Hex and other monotone set coloring games. We consider two natural conditions on such games: a game is monotone if all moves available to both…
In the last decade, stochastic models have shown to be very useful for quantitative modelling of social processes. Here, a configurational master equation for the description of behavioral changes by pair interactions of individuals is…
We prove existence theorems for strong solutions of time-dependent mean field games with non-separable Hamiltonian. In a recent announcement, we showed existence of small, strong solutions for mean field games with local coupling. We first…
This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…
Sports organizations often want to estimate athlete strengths. For games with scored outcomes, a common approach is to assume observed game scores follow a normal distribution conditional on athletes' latent abilities, which may change over…
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…
We study testable implications of multiple equilibria in discrete games with incomplete information. Unlike de Paula and Tang (2012), we allow the players' private signals to be correlated. In static games, we leverage independence of…
We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…
Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…
The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…
This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention…
Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with distinguishable variables is also known as the Dedekind's…