incident_edges
def
The relevant items E_i of agent i in a multigraph: the edges incident to i.
Statement
def incident_edges {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i : Fin n) : Finset (Fin m)- 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
- Used by 5
- orientation_prop_shareThe proportional share of agent i in a multigraph orientation instance: half her value for her incident edges (each edge is relevant to…
- relevant_min_valueAgent i's value for the least valuable of her relevant edges held by agent j, or 0 if j holds none.
- 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…
- propm_mem_betweenUnder an orientation, an edge incident to i that is held by another agent j lies in the parallel class of i and j.
- propm_sum_incidentIn a loopless multigraph, a sum over the edges incident to i splits into sums over the parallel classes at i.
Lean source view module on GitHub
/-- The relevant items `E_i` of agent `i` in the multigraph orientation model: the edges incident to vertex `i`. -/ def incident_edges {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i : Fin n) : Finset (Fin m) := Finset.univ.filter fun e => (ends e).1 = i ∨ (ends e).2 = i