Related papers: Discovering a new universal partizan ruleset
The theory of combinatorial game (like board games) and the theory of social games (where one looks for Nash equilibria) are normally considered as two separate theories. Here we shall see what comes out of combining the ideas. The central…
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze…
We investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not \mu-calculus definable. Typically, we can state that a strategy is…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
We study the computational power of the Full-Tilt model of motion planning, where slidable polyominos are moved maximally around a board by way of a sequence of directional ``tilts.'' We focus on the deterministic scenario in which the…
Many games often share common ideas or aspects between them, such as their rules, controls, or playing area. However, in the context of General Game Playing (GGP) for board games, this area remains under-explored. We propose to formalise…
We present a general framework for carrying out some constructions. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which…
For the family of complex rational functions known as "Generalized McMullen maps", F(z) = z^n + a/z^n+b, for complex parameters a and b, with a nonzero, and any integer n at least 3 fixed, we reveal, and provide a combinatorial model for,…
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chapter of this manuscript is devoted to highlighting the…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
In this paper, we introduce a notion of generalized potential games that is inspired by a newly developed theory on generalized gradient flows. More precisely, a game is called generalized potential if the simultaneous gradient of the loss…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in mis\`ere version. For this reason, several restricted universes were earlier considered for their study, in which more…
Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without being equal in general. This paper provides a survey of…
We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.
A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k-1)-BIBD defined on a km-set V . Its blocks can be arranged into an m\times(km-1) array in such a way that (1) every element of V is contained in exactly one…
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games in Cantor or Baire space, and the existence of functions generalized-recursive in a higher type-2 functional.…
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…
Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…