 Symmetric Nash equilibrium

In a game invariant under permuting players, a symmetric Nash equilibrium gives every player the same strategy, which may be a mixed strategy. Independent randomization does not require realized resource loads to be equal. When resource delays are affine, a player's expected delay depends on their own certain resource use plus the expected use by the other players; replacing all loads by unconditional total expected loads loses that own-player correction.