Pages that link to "Item:Q1322380"
From MaRDI portal
The following pages link to Absolutely expedient algorithms for learning Nash equilibria (Q1322380):
Displaying 11 items.
- A note on bimatrix games with an unknown payoff matrix (Q373800) (← links)
- Learning algorithms for repeated bimatrix Nash games with incomplete information (Q1108947) (← links)
- Learning through reinforcement and replicator dynamics (Q1381975) (← links)
- A strategic learning algorithm for state-based games (Q2173896) (← links)
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
- Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
- Verified learning without regret. From algorithmic game theory to distributed systems with mechanized complexity guarantees (Q2323998) (← links)
- Global Nash convergence of Foster and Young's regret testing (Q2384434) (← links)
- Transient and asymptotic dynamics of reinforcement learning in games (Q2462286) (← links)
- Learning automata in feedforward connectionist systems (Q4882341) (← links)
- Specification-Guided Learning of Nash Equilibria with High Social Welfare (Q6487341) (← links)
