K-SHAP: Policy Clustering Algorithm for Anonymous Multi-Agent State-Action Pairs
Andrea Coletta, Svitlana Vyetrenko, Tucker Balch

TL;DR
K-SHAP is a novel clustering algorithm that identifies and groups anonymous agent policies from state-action data in multi-agent systems, enhancing understanding of agent behaviors without requiring identity labels.
Contribution
The paper introduces K-SHAP, a new policy clustering method that leverages SHAP explanations and imitation learning to distinguish agent strategies in anonymous multi-agent data.
Findings
Outperforms existing methods in synthetic market data
Effectively identifies different agent strategies in real-world financial data
Provides interpretable explanations for agent behaviors
Abstract
Learning agent behaviors from observational data has shown to improve our understanding of their decision-making processes, advancing our ability to explain their interactions with the environment and other agents. While multiple learning techniques have been proposed in the literature, there is one particular setting that has not been explored yet: multi agent systems where agent identities remain anonymous. For instance, in financial markets labeled data that identifies market participant strategies is typically proprietary, and only the anonymous state-action pairs that result from the interaction of multiple market participants are publicly available. As a result, sequences of agent actions are not observable, restricting the applicability of existing work. In this paper, we propose a Policy Clustering algorithm, called K-SHAP, that learns to group anonymous state-action pairs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsStock Market Forecasting Methods · Complex Systems and Time Series Analysis · Financial Markets and Investment Strategies
MethodsShapley Additive Explanations
