Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback
We consider a game-theoretic setting of contention in communication networks. In a contention game each of \(n \ge 2\) identical players has a single information packet that she wants to transmit in a fast and selfish way through one of \(k \ge 1\) multiple-access channels by choosing a protocol. Here, we extend the model and results of the single-channel case studied in  by providing equilibria characterizations for more than one channels, and giving specific anonymous, equilibrium protocols with finite and infinite expected latency. For our equilibrium protocols with infinite expected latency, all players, with high probability transmit successfully in optimal time, i.e. \(\varTheta (n/k)\).
KeywordsContention resolution Multiple channels Acknowledgement-based protocol Ternary feedback Game theory
- 2.Christodoulou, G., Gairing, M., Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: Strategic contention resolution with limited feedback. In: ESA (2016)Google Scholar
- 3.Christodoulou, G., Gairing, M., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: A 3-player protocol preventing persistence in strategic contention with limited feedback. In: Bilò, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 240–251. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66700-3_19CrossRefGoogle Scholar
- 4.Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents. In: SODA (2007)Google Scholar
- 5.MacKenzie, A.B., Wicker, S.B.: Stability of multipacket slotted aloha with selfish users and perfect information. In: INFOCOM (2003)Google Scholar
- 7.So, J., Vaidya, N.H.: Multi-channel MAC for ad hoc networks: handling multi-channel hidden terminals using a single transceiver. In: Mobile Ad Hoc Networking and Computing. ACM (2004)Google Scholar