Section 8.2 — at the allocation is weighted proportionally fair
ProvedKellyStochasticNetworks.alpha_fair_one_proportionally_fairAt the weighted -fair objective is , which is the objective of — the network problem of section 7.1 with weights . By Proposition 7.4, published in mission VII of this series, solving that problem is the same as being weighted proportionally fair with those weights. So for a positive feasible aggregate rate vector ,
This is the anchor of the -family in the fairness notions of Chapter 7: is weighted proportional fairness, and hence, by Remark 7.5, also the Nash bargaining solution and a market-clearing equilibrium. The other anchors of the family are limits rather than exact identities — throughput maximization as , max-min fairness as — and are listed under contributions welcome.
Formalization Note The weights carried into Proposition 7.4 are the products , which is why positivity of the flow counts is assumed. The maximum is over the feasible set intersected with the positive orthant, since is not a real number; the fairness condition is quantified over all feasible , including boundary points, exactly as in Chapter 7.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_KellyStochasticNetworks_Congestion import Definitions.Def_KellyStochasticNetworks_FlowLevel
namespace KellyStochasticNetworks
theorem alpha_fair_one_proportionally_fair {J R : ℕ} (A : Fin J → Fin R → ℝ) (C : Fin J → ℝ)
(w n : Fin R → ℝ) (hA : ∀ j r, 0 ≤ A j r) (hw : ∀ r, 0 < w r) (hn : ∀ r, 0 < n r)
(X : Fin R → ℝ) (hXpos : ∀ r, 0 < X r) (hXfeas : X ∈ networkFeasible A C) :
IsMaxOn (alphaFairObjective w n 1) (networkFeasible A C ∩ {Y | ∀ r, 0 < Y r}) X
↔ ∀ Y ∈ networkFeasible A C, (∑ r, w r * n r * ((Y r - X r) / X r)) ≤ 0 := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.