相关论文: Categories of Games and their Fra\"iss\'e Theory

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…

The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…

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…

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…

Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…

Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…

Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…

We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe…

The mean field games (MFG) paradigm was introduced to provide tractable approximations of games involving very large populations. The theory typically rests on two key assumptions: homogeneity, meaning that all players share the same…

This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…

The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…

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…

For an arbitrary category, we consider the least class of functors con- taining the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of…

We introduce a Fra\"iss\'e theory for abstract Cuntz semigroups akin to the theory of Fra\"iss\'e categories developed by Kubi\'s. In particular, we show that any (Cuntz) Fra\"iss\'e category has a unique Fra\"iss\'e limit which is both…

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…

We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of…

This paper presents a monoidal category whose morphisms are games (in the sense of game theory, not game semantics) and an associated diagrammatic language. The two basic operations of a monoidal category, namely categorical composition and…