§3.3, p. 16 — the seller accepts a request q from a buyer believed to be θ̂ iff q ≤ γθ̂/(s+γk)
ProvedCustomerVoice.OLearn.seller_acceptancecustomizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1signaling
Under the standing assumptions, let be the seller's belief about a buyer, and let be the buyer's quality request. The seller accepts the request (that is, ) if and only if
This turns the acceptance inequality into the upper bound on acceptable requests that the rest of the O-Learning analysis uses.
Formalization Note The restriction is needed: for the acceptance inequality fails while the bound holds. Requests are in in the paper (p. 9).
Preamble
import Mathlib import Definitions.Def_CustomerVoice_OLearn_Setting
Formal statement
namespace CustomerVoice.OLearn
theorem seller_acceptance (M : Model) (hM : M.Standing) :
∀ t : CustomerVoice.ALearn.BType, ∀ q : ℝ, 0 ≤ q →
(M.accepts (M.θ t) q ↔ q ≤ M.γ * M.θ t / (M.s + M.γ * M.k)) := by sorry
end CustomerVoice.OLearn
Source
Guo, The Voice of Customers in Customization, SSRN working paper 3994319 (version of 2023-11-29, https://ssrn.com/abstract=3994319), p. 16, §3.3, before (9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.