A Detailed Analysis of a Multi-agent Diverse Team

摘要

In an open system we can have many different kinds of agents. However, it is a challenge to decide which agents to pick when forming multi-agent teams. In some scenarios, agents coordinate by voting continuously. When forming such teams, should we focus on the diversity of the team or on the strength of each member? Can a team of diverse (and weak) agents outperform a uniform team of strong agents? We propose a new model to address these questions. Our key contributions include: (ⅰ) we show that a diverse team can overcome a uniform team and we give the necessary conditions for it to happen; (ⅱ) we present optimal voting rules for a diverse team; (ⅲ) we perform synthetic experiments that demonstrate that both diversity and strength contribute to the performance of a team; (ⅳ) we show experiments that demonstrate the usefulness of our model in one of the most difficult challenges for Artificial Intelligence: Computer Go.