is_sender_optimal_scheme
def
q is obedient and maximises the sender's utility among obedient schemes.
Statement
open Finset in def is_sender_optimal_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ) (q : (ι → Bool) → (ι → Bool) → ℝ) : Prop
- 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
- is_obedient_direct_schemeAn obedient direct scheme for the prior μ on {0,1}^ι.
- persuasion_sender_utilitySender utility S(q): expected number of coordinates recommended as 1.
- Used by 4
- persuasion_uniform_two_states_ratio_leFor every finite type ι and every prior μ on ι → Bool that is uniform on 2 distinct states, the maximum receiver utility R_max(μ) is at…
- persuasion_max_receiver_utility_learXiv:2606.22226, Theorem 4.5 (ratio form). For every prior, R_max(μ) ≤ (3/2) R_0(μ).
- persuasion_max_receiver_utilityR_max(μ): the largest receiver utility among sender-optimal obedient schemes.
- persuasion_slice_valuesR_max and R_0 for the slice prior.
Lean source view module on GitHub
open Finset in /-- `q` is obedient and maximises the sender's utility among obedient schemes. -/ def is_sender_optimal_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ) (q : (ι → Bool) → (ι → Bool) → ℝ) : Prop := is_obedient_direct_scheme μ q ∧ ∀ q', is_obedient_direct_scheme μ q' → persuasion_sender_utility q' ≤ persuasion_sender_utility q