The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774): 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: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subjectivity and correlation in randomized strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlated Equilibrium as an Expression of Bayesian Rationality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizable Strategic Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizability and Correlated Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing best-response automata in repeated games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / 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: Rationalizable Strategic Behavior and the Problem of Perfection / 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.1016/0899-8256(90)90010-r / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989538212 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
The complexity of computing a best response automaton in repeated games with mixed strategies
scientific article

    Statements

    The complexity of computing a best response automaton in repeated games with mixed strategies (English)
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    best response automaton
    0 references
    two-person repeated game
    0 references
    incomplete information
    0 references
    0 references