AFTD Auto-Formalizing Theoretical Domains

relevant_min_value

def

Agent i's value for the least valuable of her relevant edges held by agent j, or 0 if j holds none.

Statement

noncomputable def relevant_min_value {m n : ℕ} (ends : Fin m → Fin n × Fin n)
    (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) (i j : Fin n) : ℝ
Defined in
Fair Orientations: Proportionality and Equitability, arXiv:2602.18098 v2, Sec. 2 (relevant items, proportional share PROP_i = sum_{e in E_i} v_i(e)/n_e); PROPm as introduced at IJCAI 2021, with the maximin value restricted to relevant items as PROPX is in Def. 2.2; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Built on 2
  • bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
  • incident_edgesThe relevant items E_i of agent i in a multigraph: the edges incident to i.
Used by 2
  • orientation_maximin_valueThe PROPm slack d_i: the maximum over other agents j of agent i's least value for a relevant edge held by j.
  • propm_orientation_of_out_degree_twoIf the simple graph underlying a loopless multigraph has an orientation with every out-degree at most two, then for nonnegative additive…

Lean source view module on GitHub

/-- Agent `i`'s value for the least valuable of her relevant items held by agent `j`, `min { v_i(e) : e ∈ π_j ∩ E_i }`, and `0` if agent `j` holds none of `i`'s relevant items. -/
noncomputable def relevant_min_value {m n : ℕ} (ends : Fin m → Fin n × Fin n)
    (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) (i j : Fin n) : ℝ :=
  if h : (bundle_of σ j ∩ incident_edges ends i).Nonempty then
    (bundle_of σ j ∩ incident_edges ends i).inf' h (u i)
  else 0
See it in the graphDiscuss this resultChallenge it