Translating Extensive Form Games to Open Games with Agency

Fredrik Nordvall Forsberg (University of Strathclyde); J\'er\'emy Ledent (University of Strathclyde); Matteo Capucci (University of Strathclyde); Neil Ghani (University of Strathclyde)

Translating Extensive Form Games to Open Games with Agency

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.06763 v2 pith:4VOOVHWQ submitted 2021-05-14 cs.GT cs.MAmath.CT

Matteo Capucci (University of Strathclyde) , Neil Ghani (University of Strathclyde) , Jérémy Ledent (University of Strathclyde) , Fredrik Nordvall Forsberg (University of Strathclyde) This is my paper · ORCID

classification cs.GTcs.MAmath.CT

keywords gamesopenoperatorsagencychoiceextensiveformlack

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion of player and their agency within open games, and the lack of choice operators. Using the former we construct the latter, and these choice operators subsume previous proposed operators for open games, thereby making progress towards a core, canonical and ergonomic calculus of game operators. Collectively these innovations increase the level of compositionality of open games, and demonstrate their expressiveness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Categories of tagged lenses
math.CT 2026-07 conditional novelty 6.0 of 10

Tagged lenses form a symmetric monoidal category, and imposing change-dependence or first-last-dependence on tags compositionally entails the getput or putput lens laws.

Pith tools