Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Repeated games with finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded computational capacity equilibrium / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite automata play the repeated prisoner's dilemma / rank | |||
Normal rank |
Revision as of 20:27, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equilibrium payoffs in repeated two-player zero-sum games of finite automata |
scientific article |
Statements
Equilibrium payoffs in repeated two-player zero-sum games of finite automata (English)
0 references
11 July 2019
0 references
matrix games
0 references
zero-sum games
0 references
repeated games
0 references
finite automata
0 references