p. 18 — BRev ≤ Rev
ProvedMultiItemRev.Decomp.brev_le_revbundlingmechanism-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue
Let be a -good random valuation in , . Then
Selling all goods as one bundle is one particular way of selling them, so its optimal revenue cannot exceed the optimal revenue. This is the step from (6) to (7) in Theorem 7.
Formalization Note is the one-good optimal revenue of the law of ; is the optimal revenue over the class of the -good model.
Preamble
import Mathlib import Definitions.Def_MultiItemRev_Decomp_Model open MeasureTheory open scoped NNReal ENNReal
Formal statement
namespace MultiItemRev.Decomp
theorem brev_le_rev {ι : Type*} [Fintype ι] [Nonempty ι]
(μ : Measure (ι → ℝ≥0)) [IsProbabilityMeasure μ] :
BRev μ ≤ Rev μ := by sorry
end MultiItemRev.Decomp
Source
Hart and Nisan, Approximate Revenue Maximization with Multiple Items, arXiv:1204.1846v3, p. 18, sentence after Theorem 7 ("because BRev≤Rev")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.