efx_anchor_family_values
def
Keep the first seven original goods with values scaled by s−1 for the first three agents and value 1 for the fourth. Append 3r common anchors worth (s−1)*1000*(s+1) to original agents and 1 to the fourth. Append s locked goods, each worth r*1000*(s+1) plus the original baseline minus 1 to an original agent and 8+3r to the fourth.
Statement
def efx_anchor_family_values (r s : ℕ) : Fin 4 → Fin ((7+(r+r+r))+s) → ℕ- Source
- Unbounded common-anchor and multi-lock extension of the OP-7 Pareto-maximal partial EFX obstruction; experiments 11503, 11509 and 11511.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Built on 2
- efx_pareto_lock_valuesThe explicit positive natural valuation rows (81,21,121,21,1,171,11,428), (51,1,91,41,101,1,31,318), (1,1,1,1,91,101,21,218), and…
- efx_pareto_lock_baselineThe original partial-allocation utilities.
- Used by 3
- efx_anchor_family_perturbed_nondegenerateIf each exponent row is injective and bounded by the number of goods, every agent assigns distinct values to distinct subsets after the…
- efx_anchor_two_locks_preserve_threeIn the two-lock anchor family, a complete EFX allocation can preserve the original three agents’ starting utilities for every positive…
- efx_anchor_family_perturbed_valuesMultiply all anchor-family valuations by 2 to the number of goods and add the agent-specific binary perturbation.
Lean source view module on GitHub
def efx_anchor_family_values (r s : ℕ) : Fin 4 → Fin ((7+(r+r+r))+s) → ℕ := fun i => Fin.addCases (Fin.addCases (fun g : Fin 7 => if i = 3 then 1 else (s-1) * efx_pareto_lock_values i g.castSucc) (fun _ : Fin (r+r+r) => if i = 3 then 1 else (s-1) * (1000*(s+1)))) (fun _ : Fin s => if i = 3 then 8+3*r else r*(1000*(s+1)) + efx_pareto_lock_baseline i - 1)