Equilibrium payoffs in repeated two-player zero-sum games of finite automata (Q2002062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129653284, #quickstatements; #temporary_batch_1730771136365
(One intermediate revision by one other user not shown)
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
Property / Wikidata QID
 
Property / Wikidata QID: Q129653284 / rank
 
Normal rank

Revision as of 02:46, 5 November 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

    Identifiers