2019
DOI: 10.48550/arxiv.1910.03656
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Bayesian open games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(20 citation statements)
references
References 0 publications
0
20
0
Order By: Relevance
“…The application to decomposition is related to the composable open games of Capucci, Ghani, Ledent, and Nordvall Forsberg 2021, Bolt, Hedges, and Zahn 2019, and Ghani, Kupke, Lambert, and Nordvall Forsberg 2018, 2020. The mathematics there is very different from the mathematics here, and more is said there about utility.…”
Section: Literaturementioning
confidence: 99%
“…The application to decomposition is related to the composable open games of Capucci, Ghani, Ledent, and Nordvall Forsberg 2021, Bolt, Hedges, and Zahn 2019, and Ghani, Kupke, Lambert, and Nordvall Forsberg 2018, 2020. The mathematics there is very different from the mathematics here, and more is said there about utility.…”
Section: Literaturementioning
confidence: 99%
“…The most important of these is the para construction, which yields a category Para(C ) of parametrised morphisms given a category C acted upon by a category of parameters M . We combine this construction with the optics construction [CEG + 20], which is known to model bidirectional information flow in dynamical systems [Mye20] and compositional game theory [BHZ19]. We argue that we can think of optics as being built of coupled parametrised and 'coparametrised' morphisms.…”
Section: Introductionmentioning
confidence: 99%
“…At its core, CGT involves a completely new representation of games -open games -with operators for constructing larger and more complex games from smaller, simpler (and hence easier to reason about) ones. Despite recent substantial interest and further development [13,10,7,6,4,11,14], open games remain complex structures, e.g. the simplest form of an open game is an 8-tuple consisting of 4 ports, a set of strategies, play and coplay functions and an equilibrium predicate.…”
Section: Introductionmentioning
confidence: 99%
“…the simplest form of an open game is an 8-tuple consisting of 4 ports, a set of strategies, play and coplay functions and an equilibrium predicate. More advanced versions [4] require sophisticated structures such as coends. This causes problems: (i) complex definitions lead to complex and even error prone proofs; (ii) proofs are programs and overly complex proofs turn into overly complex programs; (iii) even worse, this complexity deters experimentation and innovation, for instance the authors of [10] were deterred from trying alternative definitions as the work became prohibitive; and (iv) worse still, this complexity suggests we do not fully understand the mathematical structure of open games.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation