Breaking the curse of multiagency: Provably efficient decentralized multi-agent rl with function approximation
A unique challenge in Multi-Agent Reinforcement Learning (MARL) is the\emph {curse of
multiagency}, where the description length of the game as well as the complexity of many …
multiagency}, where the description length of the game as well as the complexity of many …
Policy space diversity for non-transitive games
Abstract Policy-Space Response Oracles (PSRO) is an influential algorithm framework for
approximating a Nash Equilibrium (NE) in multi-agent non-transitive games. Many previous …
approximating a Nash Equilibrium (NE) in multi-agent non-transitive games. Many previous …
Sample-efficient reinforcement learning of partially observable markov games
This paper considers the challenging tasks of Multi-Agent Reinforcement Learning (MARL)
under partial observability, where each agent only sees her own individual observations and …
under partial observability, where each agent only sees her own individual observations and …
A survey of decision making in adversarial games
In many practical applications, such as poker, chess, drug interdiction, cybersecurity, and
national defense, players often have adversarial stances, ie, the selfish actions of each …
national defense, players often have adversarial stances, ie, the selfish actions of each …
Efficient Phi-regret minimization in extensive-form games via online mirror descent
A conceptually appealing approach for learning Extensive-Form Games (EFGs) is to convert
them to Normal-Form Games (NFGs). This approach enables us to directly translate state-of …
them to Normal-Form Games (NFGs). This approach enables us to directly translate state-of …
Partially observable rl with b-stability: Unified structural condition and sharp sample-efficient algorithms
Partial Observability--where agents can only observe partial information about the true
underlying state of the system--is ubiquitous in real-world applications of Reinforcement …
underlying state of the system--is ubiquitous in real-world applications of Reinforcement …
Near-Optimal -Regret Learning in Extensive-Form Games
In this paper, we establish efficient and uncoupled learning dynamics so that, when
employed by all players in multiplayer perfect-recall imperfect-information extensive-form …
employed by all players in multiplayer perfect-recall imperfect-information extensive-form …
Sample-efficient learning of correlated equilibria in extensive-form games
Abstract Imperfect-Information Extensive-Form Games (IIEFGs) is a prevalent model for real-
world games involving imperfect information and sequential plays. The Extensive-Form …
world games involving imperfect information and sequential plays. The Extensive-Form …
An efficient deep reinforcement learning algorithm for solving imperfect information extensive-form games
One of the most popular methods for learning Nash equilibrium (NE) in large-scale imperfect
information extensive-form games (IIEFGs) is the neural variants of counterfactual regret …
information extensive-form games (IIEFGs) is the neural variants of counterfactual regret …
Adapting to game trees in zero-sum imperfect information games
Imperfect information games (IIG) are games in which each player only partially observes
the current game state. We study how to learn $\epsilon $-optimal strategies in a zero-sum …
the current game state. We study how to learn $\epsilon $-optimal strategies in a zero-sum …