paper-with-me

홈 › Papers

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

2019-04-27

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 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: $\mathbf{CsqF}$ for forms whose nodes are choice-sequences, and $\mathbf{CsetF}$ for forms whose nodes are choice-sets. I show that $\mathbf{NCF}$ is "isomorphically enclosed" in $\mathbf{CsqF}$ in the sense that each $\mathbf{NCF}$ form is isomorphic to a $\mathbf{CsqF}$ form. Similarly, I show that $\mathbf{CsqF_{\tilde a}}$ is isomorphically enclosed in $\mathbf{CsetF}$ in the sense that each $\mathbf{CsqF}$ form with no-absentmindedness is isomorphic to a $\mathbf{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.

📄 PDF Abstract BibTeX arXiv:1904.12085

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Similar Papers 제목 키워드 기반

The Category of Node-and-Choice Extensive-Form Games

2020-07-28

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

Form

Algorithms for Grey-Weighted Distance Computations

2019-05-08 · Magnus Gedda

With the increasing size of datasets and demand for real time response for interactive applications, improving runtime for algorithms with excessive computational requirements has become increasingly important. Many diff…

Open-Set Fine-Grained Retrieval via Prompting Vision-Language Evaluator

2023-01-01 · CVPR 2023 1 · Shijie Wang, Jianlong Chang, Haojie Li, Zhihui Wang 외

Open-set fine-grained retrieval is an emerging challenge that requires an extra capability to retrieve unknown subcategories during evaluation. However, current works are rooted in the close-set scenarios, where all …

Knowledge DistillationRetrievalTransfer Learning

Revisit Choice Network for Synthesis and Technology Mapping

2025-08-04 · Chen Chen, Jiaqi Yin, Cunxi Yu arxiv

Choice network construction is a critical technique for alleviating structural bias issues in Boolean optimization, equivalence checking, and technology mapping. Previous works on lossless synthesis utilize independent o…

SpatiaLab: Can Vision-Language Models Perform Spatial Reasoning in the Wild?

2026-02-03 · Azmine Toushik Wasi, Wahid Faisal, Abdur Rahman, Mahfuz Ahmed Anik 외 arxiv

Spatial reasoning is a fundamental aspect of human cognition, yet it remains a major challenge for contemporary vision-language models (VLMs). Prior work largely relied on synthetic or LLM-generated environments with lim…

Spatial Reasoning