Read the equation
Chooses a family with maximal service deficit. This implements a fairness priority when the deficit definition and service accounting are consistent; ties require a selection convention.
Terms & definitions
The recovered passage does not supply a separate symbol table. Read the source context for the notation used in this version; familiar letters may carry different meanings in other builds.
How it works
Read f* as the quantity being defined or updated by this relation.
Chooses an argument maximizing the displayed objective over the stated feasible set.
Use this version’s variable definitions and update order. The same symbol may be assigned a different meaning in another build.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
Where s_f = target share (configurable weight per family) served_f = how many times family f has been served 2. Select family with largest deficit: f* = argmax_f(Δ_f) 3. If f*'s queue is empty, borrow from nearest neighbor 4. After serving: served_f* += 1 CONVERGENCE GUARANTEE
Exact original notation
f* = argmax_f(Δ_f)