Multi-agent learning via gradient ascent activity-based credit assignment.

We consider the situation in which cooperating agents learn to achieve a common goal based solely on a global return that results from all agents' behavior. The method proposed is based on taking into account the agents' activity, which can be any additional information to help solving multi-agent decentralized learning problems. We propose a gradient ascent algorithm and assess its performance on synthetic data. [ABSTRACT FROM AUTHOR]

Copyright of Scientific Reports is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)