orientation_prop_share
def
The proportional share of agent i in a multigraph orientation instance: half her value for her incident edges (each edge is relevant to two agents).
Statement
noncomputable def orientation_prop_share {m n : ℕ} (ends : Fin m → Fin n × Fin n) (u : Fin n → Fin m → ℝ) (i : 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
- additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
- incident_edgesThe relevant items E_i of agent i in a multigraph: the edges incident to i.
- Used by 2
- is_propm_orientationAn orientation is PROPm if every agent's value for her bundle plus her PROPm slack d_i is at least her proportional share.
- 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
/-- The refined proportional share of arXiv:2602.18098 (arXiv:2602.18098, §2.2), `PROP_i = Σ_{e ∈ E_i} v_i(e) / n_e`, specialised to (loopless) multigraphs where `n_e = 2`. -/ noncomputable def orientation_prop_share {m n : ℕ} (ends : Fin m → Fin n × Fin n) (u : Fin n → Fin m → ℝ) (i : Fin n) : ℝ := additive_valuation (u i) (incident_edges ends i) / 2