bivalued_two_agent_family_feasible
def
Feasibility predicate for the two-agent common-ratio bivalued arithmetic: n1..n4 goods are of types LL, LH, HL, HH (worth (1,1), (1,r), (r,1), (r,r) to the two agents), a,b,c,d are the numbers of goods of each type given to agent 0, all inside one of the three weight-tie families (b = 0 and c = n3 for weight 1; a = b = d = 0 for weight r; a = n1, c = n3, d = n4 for weight 1/r), and the allocation is EFX (the two linear inequalities with the max-item allowances L0, L1) and meets the subsidy aggregate inequality 0 <= a0*(U0-U1) + a1*(V1-V0).
Statement
def bivalued_two_agent_family_feasible (n1 n2 n3 n4 : ℕ) (r a0 a1 : ℝ) : Prop
- Source
- step towards scaled_common_ratio_bivalued_efx_fpo_envyfreeable_two_agents
- Verified
- 01 Nov 2026
- Axioms
- none listed
Lean source view module on GitHub
/-- The two-agent common-ratio bivalued arithmetic: some allocation from one of the three weight-tie families is EFX and satisfies the subsidy aggregate inequality. -/ def bivalued_two_agent_family_feasible (n1 n2 n3 n4 : ℕ) (r a0 a1 : ℝ) : Prop := ∃ a b c d : ℕ, a ≤ n1 ∧ b ≤ n2 ∧ c ≤ n3 ∧ d ≤ n4 ∧ ((b = 0 ∧ c = n3) ∨ (a = 0 ∧ b = 0 ∧ d = 0) ∨ (a = n1 ∧ c = n3 ∧ d = n4)) ∧ (let U0 : ℝ := (a : ℝ) + (b : ℝ) + r * (c : ℝ) + r * (d : ℝ) let U1 : ℝ := ((n1 - a : ℕ) : ℝ) + ((n2 - b : ℕ) : ℝ) + r * ((n3 - c : ℕ) : ℝ) + r * ((n4 - d : ℕ) : ℝ) let V0 : ℝ := (a : ℝ) + r * (b : ℝ) + (c : ℝ) + r * (d : ℝ) let V1 : ℝ := ((n1 - a : ℕ) : ℝ) + r * ((n2 - b : ℕ) : ℝ) + ((n3 - c : ℕ) : ℝ) + r * ((n4 - d : ℕ) : ℝ) let L0 : ℝ := max (if (n3 - c) + (n4 - d) ≥ 1 then r else 0) (if (n1 - a) + (n2 - b) ≥ 1 then 1 else 0) let L1 : ℝ := max (if b + d ≥ 1 then r else 0) (if a + c ≥ 1 then 1 else 0) U1 ≤ U0 + L0 ∧ V0 ≤ V1 + L1 ∧ 0 ≤ a0 * (U0 - U1) + a1 * (V1 - V0))