The AI off-switch problem as a signalling game: bounded rationality and incomparability
Not on the map. Why?
Abstract (arXiv)
The off-switch problem is a critical challenge in AI control: if an AI system resists being switched off, it poses a significant risk. In this paper, we model the off-switch problem as a signalling game, where a human decision-maker communicates its preferences about some underlying decision problem to an AI agent, which then selects actions to maximise the human's utility. We assume that the human is a bounded rational agent and explore various bounded rationality mechanisms. Using real machine learning models, we reprove prior results and demonstrate that a necessary condition for an AI system to refrain from disabling its off-switch is its uncertainty about the human's utility. We also analyse how message costs influence optimal strategies and extend the analysis to scenarios involving incomparability.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 48 references that are in the map. First posted on arXiv 10 Feb 2025.
Builds on
8 of 48 references.
References · 8
- 2016The Off-Switch Gamecited by 97
- 2020Preferential Bayesian optimisation with Skew Gaussian Processescited by 18
- 2017A Game-Theoretic Analysis of the Off-Switch Gamecited by 8
- 2020Skew Gaussian Processes for Classificationcited by 8
- 2020Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Makingcited by 6
- 2020A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with Skew Gaussian Processescited by 6
- 2023Learning Choice Functions with Gaussian Processescited by 5
- 2024A tutorial on learning from preferences and choices with Gaussian Processescited by 4
Built on by
Not cited yet.