PapersWithELO
← ICLR 2024 leaderboard

Detecting Influence Structures in Multi-Agent Reinforcement Learning

Fabian Raoul Pieroth, katie.fitch@laralab.de, Lenz Belzner

reinforcement learningmulti-agent reinforcement learningmulti-agent interdependenciesstochastic approximationdecentralized algorithms
73.90100
Fused
band ≈ ±16 pct pts (from σ = 0.32)
69.00100
Mimo
band ≈ ±23 pct pts (from σ = 0.46)
76.80100
DeepSeek
band ≈ ±22 pct pts (from σ = 0.45)

OpenReview ground truth

Rejected

TL;DR — Introducing novel, unified metrics and decentralized algorithms in MARL to precisely quantify agent influence, with empirical validation and convergence guarantees.

Abstract

We consider the problem of quantifying the amount of influence one agent can exert on another in the setting of multi-agent reinforcement learning (MARL). As a step towards a unified approach to express agents' interdependencies, we introduce the total and state influence measurement functions. Both of these are valid for all common MARL systems, such as the discounted reward setting. Additionally, we propose novel quantities, called the total impact measurement (TIM) and state impact measurement (SIM), that characterize one agent's influence on another by the maximum impact it can have on the other agents' expected returns and represent instances of impact measurement functions in the average reward setting. Furthermore, we provide approximation algorithms for TIM and SIM with simultaneously learning approximations of agents' expected returns, error bounds, stability analyses under changes of the policies, and convergence guarantees. The approximation algorithm relies only on observing other agents' actions and is, other than that, fully decentralized. Through empirical studies, we validate our approach's effectiveness in identifying intricate influence structures in complex interactions. Our work appears to be the first study of determining influence structures in the multi-agent average reward setting with convergence guarantees.

Author context

Most prolific author: 1 submissions (credibility 1.00).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 30)