(5), p. 18 — g_T(ω_T) ≥ g_T(ω_S) gives b_S − b_T ≤ a_T − a_S
ProvedEngagementOpt.Salad.eq_5behavioral-economicsengagement-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and be points of , and write , for . If
that is , then
In the proof of Theorem 4.2 this is applied to the engagement maximizer and the utility maximizer , which is feasible for (4).
Formalization Note The paper prints (5) with a strict inequality, from "". The definition (4) of gives only , so (5) is posed with under the hypothesis ; the conclusion of Theorem 4.2 (a non-strict inequality) is unaffected.
Preamble
import Mathlib import Definitions.Def_EngagementOpt_Salad_Model
Formal statement
namespace EngagementOpt.Salad
/-- (5), p. 18, posed with `≤`: if `g_T(ω_T) ≥ g_T(ω_S)` for two points of `Ω`, then
`b_S − b_T ≤ a_T − a_S`. -/
theorem eq_5 (ωS ωT : EngagementOpt.Misalign.Params) (hS : EngagementOpt.Misalign.InOmega ωS) (hT : EngagementOpt.Misalign.InOmega ωT)
(hgT : EngagementOpt.Misalign.gT ωS ≤ EngagementOpt.Misalign.gT ωT) :
bCoef ωS - bCoef ωT ≤ aCoef ωT - aCoef ωS := by sorry
end EngagementOpt.Salad
Source
Kleinberg, Mullainathan, Raghavan, The Challenge of Understanding What Users Want, arXiv:2202.11776v3, p. 18, proof of Theorem 4.2, eq. (5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.