§4.2, p. 20, proof of Theorem 4.5 — v∗ has exactly two EFX allocations, ({h_1, h_4}, {h_2, h_3}) and its symmetric
ProvedStrategicAlloc.EFXFour.vstar_efx_iffefxfair-divisionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider four goods and the identical valuation profile in which both agents value the goods additively by
An allocation of the four goods is EFX with respect to if and only if it is one of
In the proof of Theorem 4.5 this pins down the allocation at every equilibrium of an always-EFX mechanism on ; in particular, each agent's value there is at most 2.
Formalization Note The goods are 0, 1, 2, 3; and are 6/5 and 1/10. Both directions of "there are only two EFX allocations" are stated.
Preamble
import Mathlib import Definitions.Def_StrategicAlloc_EFXFour_Setting
Formal statement
namespace StrategicAlloc.EFXFour
theorem vstar_efx_iff (A : Fin 2 → Finset (Fin 4)) (hA : StrategicAlloc.RRFair.IsAllocation A) :
StrategicAlloc.CutChoose.IsEFX (fun _ => vstar) A ↔ A = ![{0, 3}, {1, 2}] ∨ A = ![{1, 2}, {0, 3}] := by sorry
end StrategicAlloc.EFXFour
Source
Amanatidis et al., Allocating Indivisible Goods to Strategic Agents, arXiv:2109.08644v2, p. 20, proof of Theorem 4.5, Case 3, sentence after the definition of v∗
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.