On Corrigibility and Alignment in Multi Agent Games
Edmund Dable-Heath, Boyko Vodenicharski, James Bishop
TL;DR
The paper addresses corrigibility and alignment in multi-agent systems by extending the off-switch paradigm to settings with two autonomous agents and a supervising human. It uses a Bayesian game framework to model uncertainty over human preferences and over which base payoff game is being played, with a dedicated supervision-move enabling corrigibility. The authors analyze two scenarios: a two-agent corrigibility game with monotone and harmonic base games, and an adversarial defender-versus-adversary setting, deriving conditions under which a single corrigible Nash equilibrium arises. The work highlights design implications, scalability challenges, and directions for incorporating learning dynamics to maintain corrigibility as agents adapt in evolving environments.
Abstract
Corrigibility of autonomous agents is an under explored part of system design, with previous work focusing on single agent systems. It has been suggested that uncertainty over the human preferences acts to keep the agents corrigible, even in the face of human irrationality. We present a general framework for modelling corrigibility in a multi-agent setting as a 2 player game in which the agents always have a move in which they can ask the human for supervision. This is formulated as a Bayesian game for the purpose of introducing uncertainty over the human beliefs. We further analyse two specific cases. First, a two player corrigibility game, in which we want corrigibility displayed in both agents for both common payoff (monotone) games and harmonic games. Then we investigate an adversary setting, in which one agent is considered to be a `defending' agent and the other an `adversary'. A general result is provided for what belief over the games and human rationality the defending agent is required to have to induce corrigibility.
