Name
Abstract | ||
|---|---|---|
Coordination is one of the essential problems in multi-agent systems. Typically multi-agent reinforcement learning (MARL) methods treat agents equally and the goal is to solve the Markov game to an arbitrary Nash equilibrium (NE) when multiple equilibra exist, thus lacking a solution for NE selection. In this paper, we treat agents \emph{unequally} and consider Stackelberg equilibrium as a potentially better convergence point than Nash equilibrium in terms of Pareto superiority, especially in cooperative environments. Under Markov games, we formally define the bi-level reinforcement learning problem in finding Stackelberg equilibrium. We propose a novel bi-level actor-critic learning method that allows agents to have different knowledge base (thus intelligent), while their actions still can be executed simultaneously and distributedly. The convergence proof is given, while the resulting learning algorithm is tested against the state of the arts. We found that the proposed bi-level actor-critic algorithm successfully converged to the Stackelberg equilibria in matrix games and find a asymmetric solution in a highway merge environment. |
Year | Venue | DocType |
|---|---|---|
2020 | AAAI | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haifeng Zhang | 1 | 0 | 0.34 |
| Weizhe Chen | 2 | 0 | 1.35 |
| Zeren Huang | 3 | 0 | 0.68 |
| Minne Li | 4 | 5 | 2.08 |
| Yaodong Yang | 5 | 41 | 11.92 |
| Weinan Zhang | 6 | 1228 | 97.24 |
| Jun Wang | 7 | 2514 | 138.37 |