persuasion_obedience_cost
def
Obedience cost C_i(x, a): 1/2 - x_i if a_i = 1, x_i - 1/2 if a_i = 0.
Statement
open Finset in noncomputable def persuasion_obedience_cost {ι : Type*} (i : ι) (x a : ι → 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 3
- is_obedient_direct_schemeAn obedient direct scheme for the prior μ on {0,1}^ι.
- persuasion_pair_or_scheme_obedientThe pair-OR scheme of a nonnegative symmetric coupling with first marginal μ is obedient.
- persuasion_slice_sender_leSender value of the slice prior. No obedient scheme gives the sender more than C(2m+1,m) - C(2m-1,m).
Lean source view module on GitHub
open Finset in /-- Obedience cost `C_i(x, a)`: `1/2 - x_i` if `a_i = 1`, `x_i - 1/2` if `a_i = 0`. -/ noncomputable def persuasion_obedience_cost {ι : Type*} (i : ι) (x a : ι → Bool) : ℝ := if a i then 1 / 2 - (if x i then 1 else 0) else (if x i then 1 else 0) - 1 / 2