Competing Adaptive Networks

by   Stefan Vlaski, et al.

Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only on local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally optimal behavior, without the need for central coordination. Most existing strategies are developed for cooperative learning settings, where the objective of the network is common to all agents. We consider in this work a team setting, where a subset of the agents form a team with a common goal while competing with the remainder of the network. We develop an algorithm for decentralized competition among teams of adaptive agents, analyze its dynamics and present an application in the decentralized training of generative adversarial neural networks.


Signal Instructed Coordination in Team Competition

Most existing models of multi-agent reinforcement learning (MARL) adopt ...

Signal Instructed Coordination in Cooperative Multi-agent Reinforcement Learning

In many real-world problems, a team of agents need to collaborate to max...

On the Impossibility of Learning to Cooperate with Adaptive Partner Strategies in Repeated Games

Learning to cooperate with other agents is challenging when those agents...

Identifying Network Ties from Panel Data: Theory and an Application to Tax Competition

Social interactions determine many economic behaviors, but information o...

An Optimal Rewiring Strategy for Reinforcement Social Learning in Cooperative Multiagent Systems

Multiagent coordination in cooperative multiagent systems (MASs) has bee...

Cooperative Optimization for Energy Minimization: A Case Study of Stereo Matching

Often times, individuals working together as a team can solve hard probl...

The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models

Despite the significant progress in multiagent teamwork, existing resear...