This paper surveys the emerging science of how to design a “COllective INtelligence” (COIN). A COIN is a large multi-agent system where:
i) There is little to no centralized communication or control. ii) There is a provided world utility function that rates the possible histories of thefull system.
In particular, we are interested in COINs in which each agent runs a reinforcement learning (RL) algorithm. The conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather, that approach begins with explicit modeling of the dynamicsof the overall system, followed by detailed hand-tuning of the interactions betweenthe components to ensure that they “cooperate” as far as the world utility is concerned. This approach is labor-intensive, often results in highly nonrobust systems,and usually results in design techniques that have limited applicability.
In contrast, we wish to solve the COIN design problem implicitly, via the “adaptive”character of the RL algorithms of each of the agents. This approach introduces anentirely new, profound design problem:
Assuming the RL algorithms are able toachieve high rewards, what reward functions for the individual agents will, whenpursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of thecommons, Braess’s paradox, or the liquidity trap?
Although still very young, research specifically concentrating on the COIN design problem has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur’s El Farol bar problem. It is expected that as it matures and draws upon other disciplines related to COINs, this research will greatly expand the range of tasks addressable by human engineers. Moreover, in addition to drawing on them, such a fully developed science of COIN design may provide much insight into other already established scientific fields, such as economics, game theory, and population biology.
To get content containing either thought or leadership enter:
To get content containing both thought and leadership enter:
To get content containing the expression thought leadership enter:
You can enter several keywords and you can refine them whenever you want. Our suggestion engine uses more signals but entering a few keywords here will rapidly give you great content to curate.
This paper surveys the emerging science of how to design a “COllective INtelligence” (COIN). A COIN is a large multi-agent system where:
i) There is little to no centralized communication or control.
ii) There is a provided world utility function that rates the possible histories of thefull system.
In particular, we are interested in COINs in which each agent runs a reinforcement learning (RL) algorithm. The conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather, that approach begins with explicit modeling of the dynamicsof the overall system, followed by detailed hand-tuning of the interactions betweenthe components to ensure that they “cooperate” as far as the world utility is concerned. This approach is labor-intensive, often results in highly nonrobust systems,and usually results in design techniques that have limited applicability.
In contrast, we wish to solve the COIN design problem implicitly, via the “adaptive”character of the RL algorithms of each of the agents. This approach introduces anentirely new, profound design problem:
Assuming the RL algorithms are able toachieve high rewards, what reward functions for the individual agents will, whenpursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of thecommons, Braess’s paradox, or the liquidity trap?
Although still very young, research specifically concentrating on the COIN design problem has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur’s El Farol bar problem. It is expected that as it matures and draws upon other disciplines related to COINs, this research will greatly expand the range of tasks addressable by human engineers. Moreover, in addition to drawing on them, such a fully developed science of COIN design may provide much insight into other already established scientific fields, such as economics, game theory, and population biology.