§3.2.1, p. 17 — every ε-IC, IR mechanism is feasible for the path relaxation: M(ε) ⊆ M_path(ε)
ProvedApproxIC.UpperBound.Mset_subset_Mpathapproximate-incentive-compatibilitymechanism-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation
Let be a value density on and fix a path with and . For every ,
That is, a mechanism satisfying (IR) on all of and (IC) for all pairs of types satisfies (IR) on and (IC) along the path .
Consequently , the first step of the upper bound.
Formalization Note The page's "Clearly, " is stated as the set inclusion behind it; combined with the -form of Lemma 1 it yields the inequality of suprema without forming .
Preamble
import Mathlib import Definitions.Def_ApproxIC_UpperBound_Path
Formal statement
namespace ApproxIC.UpperBound
theorem Mset_subset_Mpath (M : Model) (P : Path M) (ε : ℝ) :
Mset M ε ⊆ MpathSet M P ε := by sorry
end ApproxIC.UpperBound
Source
Balseiro, Besbes, Castro, Mechanism Design under Approximate Incentive Compatibility, arXiv:2103.03403v2 (2022), p. 17, §3.2.1, (P_path), sentence after (IC_µ)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.