Related papers: A mis\`ere play $\star$-operator

Evolutionary game theory is a common framework to study the evolution of cooperation, where it is usually assumed that the same game is played in all interactions. Here, we investigate a model where the game that is played by two…

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a…

The main goal of this paper is to settle a conceptual framework for cooperative game theory in which the notion of composition/aggregation of games is the defining structure. This is done via the mathematical theory of algebraic operads: we…

We study generalized games defined over Banach spaces using variational analysis. To reformulate generalized games as quasi-variational inequality problems, we will first form a suitable principal operator and study some significant…

We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids.

In 1901, Bouton proved that a winning strategy of the game of Nim is given by the bitwise XOR, called the nim-sum. But, why does such a weird binary operation work? Led by this question, this paper introduces a categorical reinterpretation…

We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…

In this paper, we analyse inspection games with an evolutionary perspective. In our evolutionary inspection game with a large population, each individual is not a rational payoff maximiser, but periodically updates his strategy if he…

We study the properties of shifted vertex operator algebras, which are vertex algebras derived from a given theory by shifting the conformal vector. In this way, we are able to exhibit large numbers of vertex operator algebras which are…

Subtraction games have a rich literature as normal-play combinatorial games (e.g., Berlekamp, Conway, and Guy, 1982). Recently, the theory has been extended to zero-sum scoring play (Cohensius et al. 2019). Here, we take the approach of…

Examples of operator algebras with involution include the operator $*$-algebras occurring in noncommutative differential geometry studied recently by Mesland, Kaad, Lesch, and others, several classical function algebras, triangular matrix…

We reorganize, simplify and expand the theory of contractions or interior products of multivectors, and related topics like Hodge star duality. Many results are generalized and new ones are given, like: geometric characterizations of blade…

Star operations are an important tool in multiplicative ideal theory. In this paper we apply a special type of star operation, known as $\nu$-operation, to define the notion of right Pr\"ufer $\nu$-multiplication order. The latter may be…

Subtraction games are a class of impartial combinatorial games whose positions correspond to nonnegative integers and whose moves correspond to subtracting one of a fixed set of numbers from the current position. Though they are easy to…

We consider a generalization of Hausdorff operator and introduce the notion of the symbol of such an operator. Using this notion we describe the structure and investigate important properties (such as invertibility, spectrum, norm, and…

The aim of this article is to define and study a notion of unstable algebra over an operad that generalises the classical notion of unstable algebra over the Steenrod algebra. For this study we focus on the case of characteristic 2. We…

We give tolerant testers with sublinear query complexity in the adjacency-list model for Unique Games. Prior tolerant testers required structural assumptions such as expansion or clusterability. For Unique Games, the tester distinguishes…

We study first order evolutive Mean Field Games whose operators are non-coercive. This situation occurs, for instance, when some directions are `forbidden' to the generic player at some points. Under some regularity assumptions, we…

We present a new tool for the study of multiplayer stochastic games, namely the modified game, which is a normal-form game that depends on the discount factor, the initial state, and for every player a partition of the set of states and a…