The Category of Node-and-Choice Extensive-Form Games
This paper develops the category $\mathbf{NCG}$. Its objects are node-and-choice games, which include essentially all extensive-form games. Its morphisms allow arbitrary transformations of a game's nodes, choices, and players, as well as monotonic transformations of the utility functions of the game's players. Among the morphisms are subgame inclusions. Several characterizations and numerous properties of the isomorphisms are derived. For example, it is shown that isomorphisms preserve the game-theoretic concepts of no-absentmindedness, perfect-information, and (pure-strategy) Nash-equilibrium. Finally, full subcategories are defined for choice-sequence games and choice-set games, and relationships among these two subcategories and $\mathbf{NCG}$ itself are expressed and derived via isomorphic inclusions and equivalences.
Code (0)
등록된 구현이 없습니다.
Tasks
FormSimilar Papers 제목 키워드 기반
The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms
The literature specifies extensive-form games in many styles, and eventually I hope to formally translate games across those styles. Toward that end, this paper defines $\mathbf{NCF}$, the category of node-and-choice for…
FormA Category for Extensive-Form Games
This paper introduces Gm, which is a category for extensive-form games. It also provides some applications. The category's objects are games, which are understood to be sets of nodes which have been endowed with edges, i…
FormKuhn's Theorem for Games of the Extensive Form with Unawareness
We extend Kuhn's Theorem to games of the extensive form with unawareness. This extension is not obvious: First, games of the extensive form with non-trivial unawareness involve a forest of partially ordered game trees ra…
FormLow-Variance and Zero-Variance Baselines for Extensive-Form Games
Extensive-form games (EFGs) are a common model of multi-agent interactions with imperfect information. State-of-the-art algorithms for solving these games typically perform full walks of the game tree that can prove proh…
counterfactualFormTowards Functorial Language-Games
In categorical compositional semantics of natural language one studies functors from a category of grammatical derivations (such as a Lambek pregroup) to a semantic category (such as real vector spaces). We compositional…