DeepAI AI Chat
Log In Sign Up

Multiagent Evaluation under Incomplete Information

by   Mark Rowland, et al.

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. Traditionally, researchers have relied on Elo ratings for this purpose, with recent works also using methods based on Nash equilibria. Unfortunately, Elo is unable to handle intransitive agent interactions, and other techniques are restricted to zero-sum, two-player settings or are limited by the fact that the Nash equilibrium is intractable to compute. Recently, a ranking method called α-Rank, relying on a new graph-based game-theoretic solution concept, was shown to tractably apply to general games. However, evaluations based on Elo or α-Rank typically assume noise-free game outcomes, despite the data often being collected from noisy simulations, making this assumption unrealistic in practice. This paper investigates multiagent evaluation in the incomplete information regime, involving general-sum many-player games with noisy outcomes. We derive sample complexity guarantees required to confidently rank agents in this setting. We propose adaptive algorithms for accurate ranking, provide correctness and sample complexity guarantees, then introduce a means of connecting uncertainties in noisy match outcomes to uncertainties in rankings. We evaluate the performance of these approaches in several domains, including Bernoulli games, a soccer meta-game, and Kuhn poker.


page 1

page 2

page 3

page 4


A Generalized Training Approach for Multiagent Learning

This paper investigates a population-based training regime based on game...

Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games

Real world applications such as economics and policy making often involv...

α-Rank: Multi-Agent Evaluation by Evolution

We introduce α-Rank, a principled evolutionary dynamics methodology, for...

Game Theoretic Rating in N-player general-sum games with Equilibria

Rating strategies in a game is an important area of research in game the...

Optimin achieves super-Nash performance

Since the 1990s, AI systems have achieved superhuman performance in majo...

Meta-Learning in Games

In the literature on game-theoretic equilibrium finding, focus has mainl...

Estimating α-Rank by Maximizing Information Gain

Game theory has been increasingly applied in settings where the game is ...

Code Repositories


Sample code for AAAI paper Estimating α-Rank by Maximizing Information Gain

view repo