Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games (Q4593826): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s021919891750013x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2618048220 / rank | |||
Normal rank | |||
Latest revision as of 08:41, 30 July 2024
scientific article; zbMATH DE number 6807307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games |
scientific article; zbMATH DE number 6807307 |
Statements
Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games (English)
0 references
15 November 2017
0 references
game theory
0 references
repeated games
0 references
finite automata
0 references
zero-sum games
0 references
