Related papers: Multi-Structural Games and Beyond
Multilingual sentence encoders (MSEs) are commonly obtained by training multilingual language models to map sentences from different languages into a shared semantic space. As such, they are subject to curse of multilinguality, a loss of…
This article introduces differential hybrid games, which combine differential games with hybrid games. In both kinds of games, two players interact with continuous dynamics. The difference is that hybrid games also provide all the features…
Lorenzen dialogues provide a two-player game formalism that can characterize a variety of logics: each set $S$ of rules for such a game determines a set $\mathcal{D}(S)$ of formulas for which one of the players (the so-called Proponent) has…
Large language models (LLMs) offer a new empirical setting in which long-standing theories of linguistic meaning can be examined. This paper contrasts two broad approaches: social constructivist accounts associated with language games, and…
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…
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element…
Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…
We analyze the computational complexity of two 2-player games involving packing objects into a box. In the first game, players alternate drawing polycubes from a shared pile and placing them into an initially empty box in any available…
In many situations, both in human and artificial societies, cooperating agents have different status with respect to the activity and it is not uncommon that certain actions are only allowed to coalitions that satisfy certain criteria,…
Many real-world strategic games involve interactions between multiple players. We study a hierarchical multi-player game structure, where players with asymmetric roles can be separated into leaders and followers, a setting often referred to…
We introduce the Maker-Breaker domination game, a two player game on a graph. At his turn, the first player, Dominator, select a vertex in order to dominate the graph while the other player, Staller, forbids a vertex to Dominator in order…
Text-to-level generation aims to translate natural language descriptions into structured game levels, enabling intuitive control over procedural content generation. While prior text-to-level generators are typically limited to a single game…
We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive…
Let $f: M \to M$ be a $C^{1+\theta}$-partially hyperbolic diffeomorphism. We introduce a type of modified Schmidt games which is induced by $f$ and played on any unstable manifold. Utilizing it we generalize some results of \cite{Wu} as…
We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only after the first player's sequence of moves has been decided…
We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…
Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-playing bots or solving sequential decision problems. The method relies on intelligent tree search that balances exploration and exploitation. MCTS performs random…
Network games provide a natural machinery to compactly represent strategic interactions among agents whose payoffs exhibit sparsity in their dependence on the actions of others. Besides encoding interaction sparsity, however, real networks…
We consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence…
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…