Zongqing Lu, Yuxuan Yi, Ge Li, Yaowei Wang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we study the problem of networked multi-agent reinforcement learning (MARL), where a number of agents are deployed as a partially connected network and each interacts only with nearby agents. Networked MARL requires all agents to make decisions in a decentralized manner to optimize a global objective with restricted communication between neighbors over the network. Inspired by the fact that sharing plays a key role in human's learning of cooperation, we propose LToS, a hierarchically decentralized MARL framework that enables agents to learn to dynamically share reward with neighbors so as to encourage agents to cooperate on the global objective through collectives. For each agent, the high-level policy learns how to share reward with neighbors to decompose the global objective, while the low-level policy learns to optimize the local objective induced by the high-level policies in the neighborhood. The two policies form a bi-level optimization and learn alternately. We empirically demonstrate that LToS outperforms existing methods in both social dilemma and networked MARL scenarios across scales.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2112.08702")
get_code_for_paper("2112.08702")
have("2112.08702")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2112.08702.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2112.08702)
Connect an agent — have() is free.