Pages that link to "Item:Q1193774"
From MaRDI portal
The following pages link to The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774):
Displaying 15 items.
- Bounded rationality, strategy simplification, and equilibrium (Q361802) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Playing off-line games with bounded rationality (Q943583) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Limitations of learning in automata-based systems (Q1046075) (← 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)
- Rationality and bounded rationality (Q1378010) (← links)
- NP-completeness in hedonic games (Q1886742) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Plausible cooperation (Q2347768) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- Model-based learning of interaction strategies in multi-agent systems (Q4421289) (← 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)
