Lemma 1, p. 35 — for A ∈ F* and B ∈ F*_G, v(A_i ∖ (B_1 ∪ … ∪ B_n)) ≤ v(B_j ∖ A_i) for all i, j
ProvedProviderGuarantee.Bound.lemma_1allocationexchange-argumentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1provider-guarantees
Throughout, is a finite set of jobs with real values and ; there are providers ; and ; is a set of allocations satisfying Assumption 1, and satisfies Assumption 2. The optimal sets are and .
Lemma 1. Let and . Then
This optimality condition says that the jobs an optimal unrestricted allocation gives to provider , and which no optimal guaranteed allocation uses, are worth no more than what any provider holds outside in the guaranteed optimum. It is the only place where the structure of and enters the proof of Theorem 1.
Formalization Note and are expressed by IsOptimal: membership plus maximality of the total value.
Differences from the source:
- reading: Lemma 1 is stated 'for any fixed F and F_G' → F satisfies Assumption 1, F_G ⊆ F satisfies Assumption 2, and γ ∈ [γmin, γmax]^n with 0 < γmin ≤ γmax; reason: these are the standing assumptions of §2 (pp. 7–12) under which the appendix works; the proof on pp. 35–36 uses Assumption 1-(ii), (iii), (iv), Assumption 2 and γ_j > 0, and the lemma is false without them
- reading: a set of jobs D (never said to be finite; v(S) is a finite sum and maxima over F are taken) → D a finite type; reason: the page writes v(S) = Σ_{d∈S} v(d) and max over F, which presuppose finitely many jobs; the paper calls D a discrete set of jobs
- encoding: providers N = {1, …, n} → indices i : Fin n (0, …, n−1); reason: Lean convention; a relabelling, same instances
Preamble
import Mathlib import Definitions.Def_ProviderGuarantee_Bound_Model
Formal statement
namespace ProviderGuarantee.Bound
theorem lemma_1 {D : Type*} [Fintype D] [DecidableEq D] {n : ℕ} (v : D → ℝ)
(γmin γmax : ℝ) (hγmin : 0 < γmin) (hγ : γmin ≤ γmax)
(γ : Fin n → ℝ) (hγmem : ∀ i, γ i ∈ Set.Icc γmin γmax)
(F FG : Set (Fin n → Finset D)) (h1 : Assumption1 F) (h2 : Assumption2 v F FG)
(A B : Fin n → Finset D) (hA : IsOptimal γ v F A) (hB : IsOptimal γ v FG B) :
∀ i j, val v (A i \ Finset.univ.biUnion B) ≤ val v (B j \ A i) := by sorry
end ProviderGuarantee.Bound
Source
Gur, Iancu & Warnes, Value Loss in Allocation Systems with Provider Guarantees, SSRN 3351509 (version of March 24, 2020), p. 35, Lemma 1, (10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.