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
- is_sender_optimal_schemeq is obedient and maximises the sender's utility among obedient schemes.
- persuasion_receiver_utilityReceiver utility R(q): expected number of correctly guessed coordinates.
- Used by 8
- 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_receiver_ratio_optimal_constantThe optimal constant is 3/2. 3/2 is the least c with R_max(μ) ≤ c R_0(μ) for all priors μ (over all finite coordinate sets).
- bit_persuasion_bounded_support_ratio_le_three_halvesFor every natural number m, every finite type ι with [DecidableEq ι], and every prior μ on ι → Bool that is a bit prior supported on at…
- persuasion_slice_ratioThe slice prior attains ratio (3m+1)/(2m+2). For the prior uniform over the 2m+1 states of persuasion_slice_prior m (coordinates =…
- persuasion_receiver_ratio_sharpThe 3/2 bound of arXiv:2606.22226 is sharp. For every c < 3/2 there is a prior with R_max(μ) > c · R_0(μ).
- persuasion_slice_valuesR_max and R_0 for the slice prior.
- persuasion_uniform_even_ratio_le_three_halvesFor every natural number m, every finite type ι, and every prior μ on ι → Bool that is uniform on 2m distinct states, the maximum receiver…
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}