Search Results for author:
Found 50 papers, 25 papers with code
Fast computation of Nash Equilibria in Imperfect Information Games
We introduce and analyze a class of algorithms, called Mirror Ascent against an Improved Opponent (MAIO), for computing Nash equilibria in two-player zero-sum games, both in normal form and in sequential imperfect information form.
Using deep reinforcement learning to promote sustainable human behaviour on a common pool resource problem
A canonical social dilemma arises when finite resources are allocated to a group of people, who can choose to either reciprocate with interest, or keep the proceeds for themselves.
States as Strings as Strategies: Steering Language Models with Game-Theoretic Solvers
A suitable model of the players, strategies, and payoffs associated with linguistic interactions (i. e., a binding to the conventional symbolic logic of game theory) would enable existing game-theoretic algorithms to provide strategic solutions in the space of language.
Towards a Pretrained Model for Restless Bandits via Multi-arm Generalization
Restless multi-arm bandits (RMABs), a class of resource allocation problems with broad application in areas such as healthcare, online advertising, and anti-poaching, have recently been studied from a multi-agent reinforcement learning perspective.
TacticAI: an AI assistant for football tactics
The utility of TacticAI is validated by a qualitative study conducted with football domain experts at Liverpool FC.
Heterogeneous Social Value Orientation Leads to Meaningful Diversity in Sequential Social Dilemmas
In social psychology, Social Value Orientation (SVO) describes an individual's propensity to allocate resources between themself and others.
Human-Timescale Adaptation in an Open-Ended Task Space
Foundation models have shown impressive adaptation and scalability in supervised and self-supervised learning problems, but so far these successes have not fully translated to reinforcement learning (RL).
An Analysis of Quantile Temporal-Difference Learning
We analyse quantile temporal-difference learning (QTD), a distributional reinforcement learning algorithm that has proven to be a key component in several successful large-scale applications of reinforcement learning.
Distributional Reinforcement Learning
reinforcement-learning
+1
Turbocharging Solution Concepts: Solving NEs, CEs and CCEs with Neural Equilibrium Solvers
We argue that such a network is a powerful component for many possible multiagent algorithms.
Game Theoretic Rating in N-player general-sum games with Equilibria
Rating strategies in a game is an important area of research in game theory and artificial intelligence, and can be applied to any real-world competitive or cooperative setting.
Developing, Evaluating and Scaling Learning Agents in Multi-Agent Environments
The Game Theory & Multi-Agent team at DeepMind studies several aspects of multi-agent learning ranging from computing approximations to fundamental concepts in game theory to simulating social dilemmas in rich spatial environments and training 3-d humanoids in difficult team coordination tasks.
Learning Correlated Equilibria in Mean-Field Games
The designs of many large-scale systems today, from traffic routing environments to smart grids, rely on game-theoretic equilibrium concepts.
Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning
It has the additional complexity of requiring decision-making under imperfect information, similar to Texas hold'em poker, which has a significantly smaller game tree (on the order of $10^{164}$ nodes).
Statistical discrimination in learning agents
Undesired bias afflicts both human and algorithmic decision making, and may be especially prevalent when information processing trade-offs incentivize the use of heuristics.
Evolutionary Dynamics and $Φ$-Regret Minimization in Games
Importantly, $\Phi$-regret enables learning agents to consider deviations from and to mixed strategies, generalizing several existing notions of regret such as external, internal, and swap regret, and thus broadening the insights gained from regret-based analysis of learning algorithms.
Multi-Agent Training beyond Zero-Sum with Correlated Equilibrium Meta-Solvers
Two-player, constant-sum games are well studied in the literature, but there has been limited progress outside of this setting.
Time-series Imputation of Temporally-occluded Multiagent Trajectories
In multiagent environments, several decision-making individuals interact while adhering to the dynamics constraints imposed by the environment.
From Motor Control to Team Play in Simulated Humanoid Football
In a sequence of stages, players first learn to control a fully articulated body to perform realistic, human-like movements such as running and turning; they then acquire mid-level football skills such as dribbling and shooting; finally, they develop awareness of others and play as a team, bridging the gap between low-level motor control at a timescale of milliseconds, and coordinated goal-directed behaviour as a team at the timescale of tens of seconds.
Scaling up Mean Field Games with Online Mirror Descent
We address scaling up equilibrium computation in Mean Field Games (MFGs) using Online Mirror Descent (OMD).
Game Plan: What AI can do for Football, and What Football can do for AI
The rapid progress in artificial intelligence (AI) and machine learning has opened unprecedented analytics possibilities in various team and individual sports, including baseball, basketball, and tennis.
The Advantage Regret-Matching Actor-Critic
In this paper, we describe a general model-free RL method for no-regret learning based on repeated reconsideration of past behavior.
Navigating the Landscape of Multiplayer Games
Multiplayer games have long been used as testbeds in artificial intelligence research, aptly referred to as the Drosophila of artificial intelligence.
Real World Games Look Like Spinning Tops
This paper investigates the geometrical properties of real world games (e. g. Tic-Tac-Toe, Go, StarCraft II).
The Automated Inspection of Opaque Liquid Vaccines
We train 3D-ConvNets to predict the likelihood of 20-frame video samples containing anomalies.
From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
In this paper we investigate the Follow the Regularized Leader dynamics in sequential imperfect information games (IIG).
A Generalized Training Approach for Multiagent Learning
This paper investigates a population-based training regime based on game-theoretic principles called Policy-Spaced Response Oracles (PSRO).
Multiagent Evaluation under Incomplete Information
This paper investigates the evaluation of learned multiagent strategies in the incomplete information setting, which plays a critical role in ranking and training of agents.
OpenSpiel: A Framework for Reinforcement Learning in Games
OpenSpiel is a collection of environments and algorithms for research in general reinforcement learning and search/planning in games.
Neural Replicator Dynamics
Policy gradient and actor-critic algorithms form the basis of many commonly used training techniques in deep reinforcement learning.
Differentiable Game Mechanics
The decomposition motivates Symplectic Gradient Adjustment (SGA), a new algorithm for finding stable fixed points in differentiable games.
Deep reinforcement learning with relational inductive biases
We introduce an approach for augmenting model-free deep reinforcement learning agents with a mechanism for relational reasoning over structured representations, which improves performance, learning efficiency, generalization, and interpretability.
Evolving Indoor Navigational Strategies Using Gated Recurrent Units In NEAT
Simultaneous Localisation and Mapping (SLAM) algorithms are expensive to run on smaller robotic platforms such as Micro-Aerial Vehicles.
Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent
In this paper, we present exploitability descent, a new algorithm to compute approximate equilibria in two-player zero-sum extensive-form games with imperfect information, by direct policy optimization against worst-case opponents.
α-Rank: Multi-Agent Evaluation by Evolution
We introduce {\alpha}-Rank, a principled evolutionary dynamics methodology, for the evaluation and ranking of agents in large-scale multi-agent interactions, grounded in a novel dynamical game-theoretic solution concept called Markov-Conley chains (MCCs).
Robust Temporal Difference Learning for Critical Domains
We prove convergence of the operator to the optimal robust Q-function with respect to the model using the theory of Generalized Markov Decision Processes.
Actor-Critic Policy Optimization in Partially Observable Multiagent Environments
Optimization of parameterized policies for reinforcement learning (RL) is an important and challenging problem in artificial intelligence.
SCC-rFMQ Learning in Cooperative Markov Games with Continuous Actions
Although many reinforcement learning methods have been proposed for learning the optimal solutions in single-agent continuous-action domains, multiagent coordination domains with continuous actions have received relatively few investigations.
Negative Update Intervals in Deep Multi-Agent Reinforcement Learning
For instance, hysteretic Q-learning addresses miscoordination while leaving agents vulnerable towards misleading stochastic rewards.
Fast Convergence for Object Detection by Learning how to Combine Error Functions
Compared to state-of-the-art task weighting methods, the improvement is 24. 5% in convergence, and 15. 8% on the estimated pickup rate.
Re-evaluating Evaluation
Progress in machine learning is measured by careful evaluation on problems of outstanding common interest.
Relational Deep Reinforcement Learning
We introduce an approach for deep reinforcement learning (RL) that improves upon the efficiency, generalization capacity, and interpretability of conventional approaches through structured perception and relational reasoning.
Emergence of Linguistic Communication from Referential Games with Symbolic and Pixel Input
The ability of algorithms to evolve or learn (compositional) communication protocols has traditionally been studied in the language evolution literature through the use of emergent communication tasks.
Emergent Communication through Negotiation
We also study communication behaviour in a setting where one agent interacts with agents in a community with different levels of prosociality and show how agent identifiability can aid negotiation.
Inequity aversion improves cooperation in intertemporal social dilemmas
Groups of humans are often able to find ways to cooperate with one another in complex, temporally extended social dilemmas.
SA-IGA: A Multiagent Reinforcement Learning Method Towards Socially Optimal Outcomes
In multiagent environments, the capability of learning is important for an agent to behave appropriately in face of unknown opponents and dynamic environment.
The Mechanics of n-Player Differentiable Games
The first is related to potential games, which reduce to gradient descent on an implicit function; the second relates to Hamiltonian games, a new class of games that obey a conservation law, akin to conservation laws in classical mechanical systems.
A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning
To achieve general intelligence, agents must learn how to interact with others in a shared environment: this is the challenge of multiagent reinforcement learning (MARL).
A multi-agent reinforcement learning model of common-pool resource appropriation
Here we show that deep reinforcement learning can be used instead.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
Lenient Multi-Agent Deep Reinforcement Learning
We find that LDQN agents are more likely to converge to the optimal policy in a stochastic reward CMOTP compared to standard and scheduled-HDQN agents.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
Value-Decomposition Networks For Cooperative Multi-Agent Learning
We study the problem of cooperative multi-agent reinforcement learning with a single joint reward signal.
Ranked #1 on
SMAC+
on Off_Superhard_parallel
Multi-agent Reinforcement Learning
reinforcement-learning
+2
