Claim 5.2, proof — the truthful corrected make-span is optimal
ProvedAlgMechDesign.CompBonus.optimality_corrStarmechanism-designp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling
Let be an optimal allocation algorithm. Let be a positive type vector in which agent has its true type and the others their declarations , and let be any positive declaration of agent . Then
Since lists each task at the time its assigned agent needs under , both sides are make-spans of allocations under the same type vector, and the inequality says that a misreport by agent cannot produce an allocation that is better for than the optimal one. It is the displayed inequality to which the proof of Claim 5.2 reduces truthfulness.
Preamble
import Mathlib import Definitions.Def_AlgMechDesign_CompBonus_Model import Definitions.Def_AlgMechDesign_CompBonus_Mechanism
Formal statement
namespace AlgMechDesign.CompBonus
/-- The displayed inequality in the proof of Claim 5.2 (p. 188): for an optimal allocation
algorithm `alloc`, a positive profile `t = (d⁻ⁱ, tⁱ)` and every positive declaration `ti'` of
agent `i`,
`-g(x(t), corr*(x(t), t)) ≥ -g(x(ti', d⁻ⁱ), corr*(x(ti', d⁻ⁱ), t))`. -/
theorem optimality_corrStar {n k : ℕ} [NeZero n]
(alloc : (Fin n → Fin k → ℝ) → (Fin k → Fin n)) (hopt : IsOptimalAlloc alloc)
(t : Fin n → Fin k → ℝ) (ht : IsType t) (i : Fin n) (ti' : Fin k → ℝ)
(hti' : IsAgentType ti') :
-gT (alloc (Function.update t i ti')) (corrStar (alloc (Function.update t i ti')) t) ≤
-gT (alloc t) (corrStar (alloc t) t) := by sorry
end AlgMechDesign.CompBonus
Source
Nisan, Ronen, Algorithmic Mechanism Design, Games Econ. Behav. 35, 2001, p. 188, proof of Claim 5.2, first paragraph, displayed inequality in the third sentence and the fourth sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.