相关论文: On factorisations of Left dead ends
We discuss the prominent role played by bilateral symmetry and modified Pascal triangles in self twin games, a subset of constant sum homogeneous weighted majority games. We show that bilateral symmetry of the free representations…
We introduce perfect half space games, in which the goal of Player 2 is to make the sums of encountered multi-dimensional weights diverge in a direction which is consistent with a chosen sequence of perfect half spaces (chosen dynamically…
If $M$ is an atomic monoid and $x$ is a nonzero non-unit element of $M$, then the set of lengths $\mathsf{L}(x)$ of $x$ is the set of all possible lengths of factorizations of $x$, where the length of a factorization is the number of…
We prove that the codes issued from the elimination of any subalphabet in a trace monoid are finite state recognizable. This implies in particular that the transitive factorizations of the trace monoids are recognizable by (boolean)…
Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…
The notion of a \textbf{$\boldsymbol{\mathcal{C}}$-filtered} object, where $\mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture…
The work we present in this paper initiated the formal study of fractional hedonic games, coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings,…
This paper studies a one-dimensional Mean-Field Planning (MFP) system with a non-local, rank-based coupling. Using a potential formulation, we rewrite the system as an associated scalar partial differential equation. We prove an equivalence…
A fortification game (FG) is a three-level, two-player Stackelberg game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some assets to be protected from potential malicious attacks. At…
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 offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a…
Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with perfect information, TARK21], we studied well-founded games, a natural extension of finite extensive games with perfect information in which all plays are finite. We…
In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a…
Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…
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…
First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent workflows like conference management systems. Desirable…
In game theory, players have continuous expected payoff functions and can use fixed point theorems to locate equilibria. This optimization method requires that players adopt a particular type of probability measure space. Here, we introduce…
We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity…