5 citations · 7 across the 8 of their papers we have counts for
5 papers · 1 filter
Approximating Nash Equilibria in General-Sum Games via Meta-Learning
David Sychrovský, Christopher Solinas, Revan MacQueen +4
Nash equilibrium is perhaps the best-known solution concept in game theory. Such a solution assigns a strategy to each player which offers no incentive to unilaterally deviate. Whi…
Opponent Modeling in Multiplayer Imperfect-Information Games
Sam Ganzfried, Kevin A. Wang, Max Chiswick
In many real-world settings agents engage in strategic interactions with multiple opposing agents who can employ a wide variety of strategies. The standard approach for designing a…
Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games
Stephen McAleer, JB Lanier, Kevin Wang +3
In competitive two-agent environments, deep reinforcement learning (RL) methods based on the \emph{Double Oracle (DO)} algorithm, such as \emph{Policy Space Response Oracles (PSRO)…
Anytime PSRO for Two-Player Zero-Sum Games
Stephen McAleer, Kevin Wang, John Lanier +4
Policy space response oracles (PSRO) is a multi-agent reinforcement learning algorithm that has achieved state-of-the-art performance in very large two-player zero-sum games. PSRO…
XDO: A Double Oracle Algorithm for Extensive-Form Games
Stephen McAleer, John Lanier, Kevin Wang +2
Policy Space Response Oracles (PSRO) is a reinforcement learning (RL) algorithm for two-player zero-sum games that has been empirically shown to find approximate Nash equilibria in…