The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms

04/27/2019 ∙ by Peter A. Streufert, et al. ∙ 0

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 NCF, the category of node-and-choice forms. The category's objects are extensive forms in essentially any style, and the category's isomorphisms are made to accord with the literature's small handful of ad hoc style equivalences. Further, this paper develops two full subcategories: CsqF for forms whose nodes are choice-sequences, and CsetF for forms whose nodes are choice-sets. I show that NCF is "isomorphically enclosed" in CsqF in the sense that each NCF form is isomorphic to a CsqF form. Similarly, I show that CsqF_ã is isomorphically enclosed in CsetF in the sense that each CsqF form with no-absentmindedness is isomorphic to a CsetF form. The converses are found to be almost immediate, and the resulting equivalences unify and simplify two ad hoc style equivalences in Kline and Luckraz 2016 and Streufert 2019. Aside from the larger agenda, this paper already makes three practical contributions. Style equivalences are made easier to derive by [1] a natural concept of isomorphic invariance and [2] the composability of isomorphic enclosures. In addition, [3] some new consequences of equivalence are systematically deduced.



There are no comments yet.


This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.