Robust Multi-agent Counterfactual Prediction
We consider the problem of using logged data to make predictions about what would happen if we changed the `rules of the game' in a multi-agent system. This task is difficult because in many cases we observe actions individuals take but not their private information or their full reward functions. In addition, agents are strategic, so when the rules change, they will also change their actions. Existing methods (e.g. structural estimation, inverse reinforcement learning) make counterfactual predictions by constructing a model of the game, adding the assumption that agents' behavior comes from optimizing given some goals, and then inverting observed actions to learn agent's underlying utility function (a.k.a. type). Once the agent types are known, making counterfactual predictions amounts to solving for the equilibrium of the counterfactual environment. This approach imposes heavy assumptions such as rationality of the agents being observed, correctness of the analyst's model of the environment/parametric form of the agents' utility functions, and various other conditions to make point identification possible. We propose a method for analyzing the sensitivity of counterfactual conclusions to violations of these assumptions. We refer to this method as robust multi-agent counterfactual prediction (RMAC). We apply our technique to investigating the robustness of counterfactual claims for classic environments in market design: auctions, school choice, and social choice. Importantly, we show RMAC can be used in regimes where point identification is impossible (e.g. those which have multiple equilibria or non-injective maps from type distributions to outcomes).
Code (0)
등록된 구현이 없습니다.
Tasks
counterfactualPredictionReinforcement LearningSimilar Papers 제목 키워드 기반
Estimating counterfactual treatment outcomes over time in complex multiagent scenarios
Evaluation of intervention in a multiagent system, e.g., when humans should intervene in autonomous driving systems and when a player should pass to teammates for a good shot, is challenging in various engineering and sc…
Autonomous DrivingcounterfactualPredictionPAC: Assisted Value Factorisation with Counterfactual Predictions in Multi-Agent Reinforcement Learning
Multi-agent reinforcement learning (MARL) has witnessed significant progress with the development of value function factorization methods. It allows optimizing a joint action-value function through the maximization of fa…
counterfactualMulti-agent Reinforcement Learningreinforcement-learningReinforcement Learning+4Counterfactual Regularization for Model-Based Reinforcement Learning
In sequential tasks, planning-based agents have a number of advantages over model-free agents, including sample efficiency and interpretability. Recurrent action-conditional latent dynamics models trained from pixel-leve…
counterfactualmodelModel-based Reinforcement Learningreinforcement-learning+2Counterfactual Explanation with Multi-Agent Reinforcement Learning for Drug Target Prediction
Motivation: Many high-performance DTA models have been proposed, but they are mostly black-box and thus lack human interpretability. Explainable AI (XAI) can make DTA models more trustworthy, and can also enable scientis…
counterfactualCounterfactual ExplanationExplainable Artificial Intelligence (XAI)Multi-agent Reinforcement Learning+2Integrating Counterfactual Simulations with Language Models for Explaining Multi-Agent Behaviour
Autonomous multi-agent systems (MAS) are useful for automating complex tasks but raise trust concerns due to risks like miscoordination and goal misalignment. Explainability is vital for trust calibration, but explainabl…
Autonomous DrivingcounterfactualPrediction