AFTD Auto-Formalizing Theoretical Domains

is_graph_valuation

def

In the graph model each agent values only the edges incident to her: v_i(X) = v_i(X ∩ E_i).

Statement

def is_graph_valuation {m n : ℕ} (ends : Fin m → Fin n × Fin n)
    (v : Fin n → Finset (Fin m) → ℝ) : Prop
Defined in
On the Subsidy of Envy-Free Orientations in Graphs, arXiv:2502.13671 v1, Sec. 2; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

/-- Every agent values only the edges incident to her: `v i X = v i (X ∩ E_i)`. -/
def is_graph_valuation {m n : ℕ} (ends : Fin m → Fin n × Fin n)
    (v : Fin n → Finset (Fin m) → ℝ) : Prop :=
  ∀ i S, v i S = v i (S.filter fun e => (ends e).1 = i ∨ (ends e).2 = i)
See it in the graphDiscuss this resultChallenge it