mlsanityData to 14 Oct 2026

Quantifying Theoretical AI Alignment Guarantees: Receiver-Utility Bounds in Bayesian Persuasion

arXiv 2606.22226 ↗First posted 20 Jun 2026cs.GT cs.AI cs.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

Misalignment can change how information moves from an AI agent to a human user. We model this as an information advantage: the AI agent observes the world state, while the human receiver only knows a prior and must act after seeing the agent's signal. A strategic AI sender may withhold evidence or garble information in order to steer the human's decision. We ask how much useful information can still reach the human when the AI optimizes a misaligned objective. We study a Bayesian persuasion model in which the world state is a bit string, the human receiver wants to guess the bits correctly, and a single AI sender wants the receiver to guess as many bits as possible as 1. For a prior μ, let R0(μ) be the receiver's utility from using only the prior, and let Rmax(μ) be the largest receiver utility among signaling schemes that are optimal for the sender. We prove Rmax(μ)/R0(μ)≤ 3/2. This bound improves for priors close to the independent product prior with the same marginals: if μ(x)≥ (1-η)πμ(x) for every state x, then Rmax(μ)≤ R0(μ)+η n. We also give a six-bit prior for which Rmax(μ)/R0(μ)=39/31>5/4, so no universal 5/4 bound is possible.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 8 references that are in the map. First posted on arXiv 20 Jun 2026.

Builds on

4 of 8 references.

References · 4

  1. 2016Algorithmic Persuasion with No Externalitiescited by 9
  2. 2024Multi-Sender Persuasion: A Computational Perspectivecited by 9
  3. 2019On the Tractability of Public Persuasion with No Externalitiescited by 6
  4. 2025Emergent Alignment via Competitioncited by 5

Built on by

Not cited yet.