On Adaptive Conflict Resolution Algorithms in a Multiple Access Channel

A new upper bound is derived on the minimum of the maximum time to resolve a conflict of multiplicity $k$ for adaptive algorithms. This bound asymptotically coincides with the lower bound for nonadaptive protocol lengths. For an a priori known $k=4$, an adaptive algorithm is constructed which is asymptotically more efficient than any nonadaptive algorithm.