Related papers: What happens when we add impartial loopy games and…
In this paper, we propose and analyse two game theoretical models useful to design marketing channels attribution mechanisms based on cooperative TU games and bankruptcy problems, respectively. First, we analyse the Sum Game, a coalitional…
We investigate game-theoretic variants of cardinal invariants of the continuum. The invariants we treat are the reaping number $\mathfrak{r}$, the bounding number $\mathfrak{b}$, the dominating number $\mathfrak{d}$, and the additivity…
I present a formal connection between algebraic effects and game semantics, two important lines of work in programming languages semantics with applications in compositional software verification. Specifically, the algebraic signature…
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…
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals:…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…
After the social learning models were proposed, finding the solutions of the games becomes a well-defined mathematical question. However, almost all papers on the games and their applications are based on solutions built upon either an…
Absolute Universes of combinatorial games, as defined in a recent paper by the same authors, include many standard short normal- mis\`ere- and scoring-play monoids. In this note we show that the class is categorical, by extending Joyal's…
In this paper, we consider $\mathcal{L}\mathcal{R}$-ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are the same. However, there are two kinds of terminal positions.…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…
The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found on the linear-time/branching-time spectrum, over general system types. We describe a generic…
We introduce $p$-adic manifold learning, propose an algorithm to solve it, and propose benchmark tasks from impartial games.
In this paper, we introduce a two-player impartial game on graphs, called a {\em feedback game}, which is a variant of the generalized geography. We study the feedback game on Eulerian graphs. In particular, we show that the…
We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected…
This paper is concerned with a new type of differential game problems of forwardbackward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations,…
Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…
In cooperative game theory, associated games allow for providing meaningful characterizations of solution concepts. Moreover, generalized values allow computing an influence or power index of each coalition in a game. In this paper, we view…
Consider equipping an alphabet $\mathcal{A}$ with a group action that partitions the set of words into equivalence classes which we call patterns. We answer standard questions for the Penney's game on patterns and show non-transitivity for…
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with…