lxv_opt
def
The allocation with bundles {g2,g3}, {g4}, {g1,g5}, {g6}.
Statement
def lxv_opt : Fin 6 → Fin 4- Source
- step towards leximin_ef1_not_pareto_optimal (conjecture of The Unreasonable Fairness of Maximum Nash Welfare, ACM TEAC 7(3), 2019, App. B)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Used by 3
- lxv_checkThe finite check over all 4^6 allocations: lxv_opt is EF1, no EF1 allocation has a strictly better leximin profile, and any EF1 allocation…
- leximin_ef1_not_pareto_optimalChoosing the leximin-optimal allocation among EF1 allocations does not guarantee Pareto optimality, even for normalised additive…
- lxv_check_specUnpacked finite check: lxv_opt is EF1, no EF1 allocation is strictly leximin-better, and every EF1 allocation not strictly leximin-worse…
Lean source view module on GitHub
/-- The leximin-optimal EF1 allocation: bundles {g2,g3}, {g4}, {g1,g5}, {g6}. -/ def lxv_opt : Fin 6 → Fin 4 := ![2, 0, 0, 1, 2, 3]