Distributed No-Regret Learning in Multi-Agent Systems

02/20/2020
by   Xiao Xu, et al.
0

In this tutorial article, we give an overview of new challenges and representative results on distributed no-regret learning in multi-agent systems modeled as repeated unknown games. Four emerging game characteristics—dynamicity, incomplete and imperfect feedback, bounded rationality, and heterogeneity—that challenge canonical game models are explored. For each of the four characteristics, we illuminate its implications and ramifications in game modeling, notions of regret, feasible game outcomes, and the design and analysis of distributed learning algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2020

Algorithms in Multi-Agent Systems: A Holistic Perspective from Reinforcement Learning and Game Theory

Deep reinforcement learning (RL) has achieved outstanding results in rec...
research
05/17/2021

The Confluence of Networks, Games and Learning

Recent years have witnessed significant advances in technologies and ser...
research
05/31/2023

Is Learning in Games Good for the Learners?

We consider a number of questions related to tradeoffs between reward an...
research
06/05/2019

Finding Friend and Foe in Multi-Agent Games

Recent breakthroughs in AI for multi-agent games like Go, Poker, and Dot...
research
04/20/2016

Procedural urban environments for FPS games

This paper presents a novel approach to procedural generation of urban m...
research
10/10/2019

Passive network evolution promotes group welfare in complex networks

The Parrondo's paradox is a counterintuitive phenomenon in which individ...
research
12/20/2021

Balancing Adaptability and Non-exploitability in Repeated Games

We study the problem of guaranteeing low regret in repeated games agains...

Please sign up or login with your details

Forgot password? Click here to reset