AFTD Auto-Formalizing Theoretical Domains

persuasion_max_receiver_utility

def

R_max(μ): the largest receiver utility among sender-optimal obedient schemes.

Statement

open Finset in
noncomputable def persuasion_max_receiver_utility {ι : Type*} [Fintype ι] [DecidableEq ι]
    (μ : (ι → Bool) → ℝ) : ℝ
Defined in
Quantifying Theoretical AI Alignment Guarantees: Receiver-Utility Bounds in Bayesian Persuasion, arXiv:2606.22226 v1, Sec. 3 (bit-string model, direct obedient form, R_0, S*, R_max); formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Built on 2
Used by 8

Lean source view module on GitHub

open Finset in
/-- `R_max(μ)`: the largest receiver utility among sender-optimal obedient schemes. -/
noncomputable def persuasion_max_receiver_utility {ι : Type*} [Fintype ι] [DecidableEq ι]
    (μ : (ι → Bool) → ℝ) : ℝ :=
  sSup {r | ∃ q, is_sender_optimal_scheme μ q ∧ r = persuasion_receiver_utility q}
See it in the graphDiscuss this resultChallenge it