Strategic complexity in repeated extensive games (Q2437166): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049359857 / rank
 
Normal rank
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: Q3956774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary stability in repeated games played by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiperson Bargaining and Strategic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coase theorem, complexity and transaction costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic complexity in repeated extensive games / 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 equilibria with discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata play a repeated extensive game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata play the repeated prisoner's dilemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bargaining and markets: Complexity and the competitive outcome / rank
 
Normal rank

Latest revision as of 10:34, 7 July 2024

scientific article
Language Label Description Also known as
English
Strategic complexity in repeated extensive games
scientific article

    Statements

    Strategic complexity in repeated extensive games (English)
    0 references
    0 references
    3 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    strategic complexity
    0 references
    finite automaton
    0 references
    repeated game
    0 references
    extensive game
    0 references
    prisoner's dilemma
    0 references
    multiple complexity
    0 references
    0 references