English
Related papers

Related papers: On the Structure of Mis\`ere Impartial Games

200 papers

Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…

Combinatorics · Mathematics 2023-03-10 U. Larsson , R. J. Nowakowski , C. P. Santos

In this paper we will be examining impartial scoring play games. We first give the basic definitions for what impartial scoring play games are and look at their general structure under the disjunctive sum. We will then examine the game of…

Combinatorics · Mathematics 2012-08-07 Fraser Stewart

We study an impartial game introduced by Anderson and Harary. The 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…

Group Theory · Mathematics 2024-02-12 Bret J. Benesh , Dana C. Ernst , Nandor Sieben

We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the…

Combinatorics · Mathematics 2024-02-12 Bret J. Benesh , Dana C. Ernst , Nandor Sieben

Zero-sum stochastic games provide a rich model for competitive decision making. However, under general forms of state uncertainty as considered in the Partially Observable Stochastic Game (POSG), such decision making problems are still not…

Artificial Intelligence · Computer Science 2016-06-23 Auke J. Wiggers , Frans A. Oliehoek , Diederik M. Roijers

The mean field games system is a coupled pair of nonlinear partial differential equations arising in differential game theory, as a limit as the number of agents tends to infinity. We prove existence and uniqueness of classical solutions…

Analysis of PDEs · Mathematics 2020-01-28 David M. Ambrose

New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary.…

Combinatorics · Mathematics 2008-02-03 Daniel E. Loeb

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…

Combinatorics · Mathematics 2025-11-17 Ryuya Hora

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…

Computer Science and Game Theory · Computer Science 2017-03-09 Daizhan Cheng , Ting Liu

We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the subcomponents corresponding to a minimum…

Discrete Mathematics · Computer Science 2019-06-24 Alexandre Skoda

We present a method of backward induction for computing approximate subgame perfect Nash equilibria of infinitely repeated games with discounted payoffs. This uses the selection monad transformer, combined with the searchable set monad…

Computer Science and Game Theory · Computer Science 2018-07-12 Jules Hedges

We study a game where two players take turns selecting points of a convex geometry until the convex closure of the jointly selected points contains all the points of a given winning set. The winner of the game is the last player able to…

Combinatorics · Mathematics 2021-04-20 Stephanie McCoy , Nándor Sieben

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…

Combinatorics · Mathematics 2019-05-03 Nicholas Ham

The disjunctive sum of impartial games is analyzed by Sprague-Grundy theory. The theory has been extended to loopy games and entailing games by early results. In this study, we consider further extension of this theory and show partial…

Combinatorics · Mathematics 2024-04-02 Koki Suetsugu

We study the $\star$-operator (Larsson et al. 2011) of impartial vector subtraction games (Golomb 1965). Here we extend the notion to the mis\`ere-play convention, and prove convergence and other properties; notably more structure is…

Combinatorics · Mathematics 2016-08-26 Matthieu Dufour , Silvia Heubach , Urban Larsson

We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic…

Computer Science and Game Theory · Computer Science 2018-04-19 Warut Suksompong

We study coalition structure formation with intra and inter-coalition externalities in the introduced family of nested non-cooperative simultaneous finite games. A non-cooperative game embeds a coalition structure formation mechanism, and…

Computer Science and Game Theory · Computer Science 2021-07-05 Dmitry Levando

We deal with coalitional games possessing strictly positive values. Individually rational allocations of such a game has clear fractional interpretations. Many concepts, including the long-existing core and other stability notions more…

Theoretical Economics · Economics 2023-04-24 Jian Yang

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…

Combinatorics · Mathematics 2018-07-31 Urban Larsson , Rebecca Milley , Richard Nowakowski , Gabriel Renault , Carlos Santos

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,…

Logic in Computer Science · Computer Science 2020-09-16 Neil Ghani , Clemens Kupke , Alasdair Lambert , Fredrik Nordvall Forsberg