Winning the Lottery: Learning Perfect Coordination with Minimal Feedback
Coordination is a central problem whenever stations (or nodes or users) share resources across a network. Absent coordination, there will be collision, congestion or interference, with concomitant loss of performance. This paper proposes new protocols, which the authors call Perfect Coordination (PC) protocols that solve the coordination problem. PC proposals are completely distributed (requiring neither central control nor the exchange of any control messages), fast (with speeds comparable to those of any existing protocols), fully efficient (achieving perfect coordination, with no collisions and no gaps) and require minimal feedback (stations that (attempt to) access resources learn whether or not they are successful, but stations that do not learn nothing at all).