Pages that link to "Item:Q1106110"

The following pages link to The complexity of computing best-response automata in repeated games (Q1106110):

Displaying 18 items.

• Bounded rationality, strategy simplification, and equilibrium (Q361802) (← links)
• Bottom-up design of strategic options as finite automata (Q601965) (← links)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• Computational complexity in additive hedonic games (Q1046065) (← links)
• Limitations of learning in automata-based systems (Q1046075) (← links)
• On players with a bounded number of states (Q1187868) (← links)
• Nash and correlated equilibria: Some complexity considerations (Q1191824) (← links)
• The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774) (← links)
• Predicting the effects of intervention and sabotage in a bounded complex game (Q1196273) (← links)
• Bayesian boundedly rational agents play the finitely repeated prisoner's dilemma (Q1316659) (← links)
• Computability, complexity and economics (Q1318305) (← links)
• Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653) (← links)
• Rationality and bounded rationality (Q1378010) (← links)
• NP-completeness in hedonic games (Q1886742) (← links)
• Modeling emotions and reason in agent-based systems (Q2267812) (← links)
• Plausible cooperation (Q2347768) (← links)
• Complexity of games and bounded rationality (Q3202087) (← links)
• A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)