persuasion_receiver_utility
def
Receiver utility R(q): expected number of correctly guessed coordinates.
Statement
open Finset in noncomputable def persuasion_receiver_utility {ι : Type*} [Fintype ι] [DecidableEq ι] (q : (ι → Bool) → (ι → 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
- Used by 6
- 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_pair_or_receiver_add_senderA pair-OR scheme never recommends 0 on a coordinate equal to 1, so the trade-off of Lemma 4.2 is an equality for it.
- persuasion_receiver_add_sender_leSender–receiver trade-off (Lemma 4.2). R(q) + S(q) ≤ n + ∑_i p_i(μ).
- persuasion_slice_valuesR_max and R_0 for the slice prior.
Lean source view module on GitHub
open Finset in /-- Receiver utility `R(q)`: expected number of correctly guessed coordinates. -/ noncomputable def persuasion_receiver_utility {ι : Type*} [Fintype ι] [DecidableEq ι] (q : (ι → Bool) → (ι → Bool) → ℝ) : ℝ := ∑ x, ∑ a, q x a * ((Finset.univ.filter (fun i => a i = x i)).card : ℝ)