Using k-Selection in Radio Networks as an example of unique-resource dispute among k unknown contenders, the conflict-resolution protocol presented in this paper shows that, for any sensible probability of error ε, all of them get access to such resource in asymptotically optimal time (e+1+ ξ)k+O(log(1/ε)), where ξ > 0 is any constant arbitrarily close to 0. This protocol works under a model wh...