Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 13 — willingness to pay for a data append: U_ij − U_i0 = −T_j + σ_l(α_j)[c_i − v_l(α_j)], increasing in c_i

Proved
SellingData.AppendsBinary.willingness_to_pay

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

data-marketsinformation-sellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1screening

Consider the data-append model with costs cL<cH<u^c_L<c_H<\hat ucL​<cH​<u^, a menu with plans (TH,αH)(T_H,\alpha_H)(TH​,αH​), (TL,αL)(T_L,\alpha_L)(TL​,αL​), and a plan j∈{H,L}j\in\{H,L\}j∈{H,L} with αj∈[α‾,αˉ]\alpha_j\in[\underline\alpha,\bar\alpha]αj​∈[α​,αˉ]. Then for each type i∈{H,L}i\in\{H,L\}i∈{H,L} the willingness to pay for plan jjj over the outside option Ui0=max⁡{u^−ci,0}U_{i0}=\max\{\hat u-c_i,0\}Ui0​=max{u^−ci​,0} is

Uij−Ui0=−Tj+σl(αj) [ci−vl(αj)].U_{ij}-U_{i0}=-T_j+\sigma_l(\alpha_j)\,[c_i-v_l(\alpha_j)] .Uij​−Ui0​=−Tj​+σl​(αj​)[ci​−vl​(αj​)].

Moreover, the map c↦−Tj+σl(αj)[c−vl(αj)]c\mapsto -T_j+\sigma_l(\alpha_j)[c-v_l(\alpha_j)]c↦−Tj​+σl​(αj​)[c−vl​(αj​)] is strictly increasing, and in particular the high-cost type values plan jjj strictly more than the low-cost type:

ULj−UL0<UHj−UH0.U_{Lj}-U_{L0}<U_{Hj}-U_{H0}.ULj​−UL0​<UHj​−UH0​.

This is why, with data appends and costs below the prior mean, the high-cost marketers become the "high type" of the screening problem, reversing the roles they have with marketing lists.

Preamble
import Mathlib
import Definitions.Def_SellingData_AppendsBinary_Setting
Formal statement
namespace SellingData.AppendsBinary

open Model

/-- §3.2, p. 13: when `c_L < c_H < û`, a marketer's willingness to pay for plan `(T_j, α_j)`,
`U_ij − U_i0`, equals `−T_j + σ_l(α_j)[c_i − v_l(α_j)]`, which is increasing in `c_i`. -/
theorem willingness_to_pay (M : Model) (hcH : M.cH < M.uHat) (m : Menu) (j : SellingData.ListsBinary.CostType)
    (hαj : m.α j ∈ Set.Icc M.aLo M.aHi) :
    (∀ i : SellingData.ListsBinary.CostType,
        M.U m i j - M.outside (M.c i) = -(m.T j) + M.σl (m.α j) * (M.c i - M.vl (m.α j))) ∧
      StrictMono (fun c : ℝ => -(m.T j) + M.σl (m.α j) * (c - M.vl (m.α j))) ∧
      M.U m SellingData.ListsBinary.CostType.L j - M.outside M.cL < M.U m SellingData.ListsBinary.CostType.H j - M.outside M.cH := by sorry

end SellingData.AppendsBinary
Source
Guo, Selling Data to Marketers, author's manuscript (Management Science, doi:10.1287/mnsc.2023.01350), p. 13, §3.2, second paragraph
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me