Abstract
In this paper, we study contention resolution protocols from a game-theoretic perspective. In a recent work [8], we considered acknowledgment-based protocols, where a user gets feedback from the channel only when she attempts transmission. In this case she will learn whether her transmission was successful or not. One of the main results of [8] was that no acknowledgment-based protocol can be in equilibrium. In fact, it seems that many natural acknowledgment-based protocols fail to prevent users from unilaterally switching to persistent protocols that always transmit with probability 1. It is therefore natural to ask how powerful a protocol must be so that it can beat persistent deviators.
In this paper we consider age-based protocols, which can be described by a sequence of probabilities of transmitting in each time step. Those probabilities are given beforehand and do not change based on the transmission history. We present a 3-player age-based protocol that can prevent users from unilaterally deviating to a persistent protocol in order to decrease their expected transmission time. It is worth noting that the answer to this question does not follow from the results and proof ideas of [8]. Our protocol is non-trivial, in the sense that, when all players use it, finite expected transmission time is guaranteed. In fact, we show that this protocol is preferable to any deadline protocol in which, after some fixed time, attempt transmission with probability 1 in every subsequent step. An advantage of our protocol is that it is very simple to describe, and users only need a counter to keep track of time. Whether there exist n-player age-based protocols that do not use counters and can prevent persistence is left as an open problem for future research.
This is a preview of subscription content, log in via an institution.
Notes
- 1.
Abusing notation slightly, we will also write \(C^{{\varvec{f}}}_i(\varvec{h}_0)\) for the unconditional expected latency of player i induced by \({\varvec{f}}\).
- 2.
For an anonymous protocol f, we denote by \((f_{-i}, f'_i)\) the profile where agent \(j \ne i\) uses protocol f and agent i uses protocol \(f'_i\).
References
Abramson, N.: The ALOHA system: another alternative for computer communications. In: Proceedings of the Fall Joint Computer Conference, 17–19 November 1970, pp. 281–285. ACM New York (1970)
Altman, E., El Azouzi, R., Jiménez, T.: Slotted aloha as a game with partial information. Comput. Netw. 45(6), 701–713 (2004)
Altman, E., Barman, D., Benslimane, A., Azouzi, R.: Slotted aloha with priorities and random power. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 610–622. Springer, Heidelberg (2005). doi:10.1007/11422778_49
Auletta, V., Moscardelli, L., Penna, P., Persiano, G.: Interference games in wireless networks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 278–285. Springer, Heidelberg (2008). doi:10.1007/978-3-540-92185-1_34
Bender, M., Farach-Colton, M., He, S., Kuszmaul, B., Leiserson, C.: Adversarial contention resolution for simple channels. In: SPAA 2005, pp. 325–332. ACM (2005)
Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25(5), 505–515 (1979)
Christodoulou, G., Gairing, M., Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: A 3-player protocol preventing persistence in strategic contention with limited feedback. arXiv:1707.01439 [cs.GT]
Christodoulou, G., Gairing, M., Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: Strategic contention resolution with limited feedback. In: Proceedings of the 24th Annual European Symposium on Algorithms (ESA), pp. 30:1–30:16 (2016)
Christodoulou, G., Ligett, K., Pyrga, E.: Contention resolution under selfishness. Algorithmica 70(4), 675–693 (2014)
Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents. In: SODA 2007, pp. 179–188. SIAM, Philadelphia (2007)
Geréb-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: SPAA 1992, pp. 41–48. ACM, New York (1992)
Goldberg, L.A., MacKenzie, P.D.: Analysis of practical backoff protocols for contention resolution with multiple servers. J. Comput. Syst. Sci. 58(1), 232–258 (1999)
Goldberg, L.A., Mackenzie, P.D., Paterson, M., Srinivasan, A.: Contention resolution with constant expected delay. J. ACM 47(6), 1048–1096 (2000)
Goldberg, L.A.: Notes on contention resolution (2002). http://www.cs.ox.ac.uk/people/leslieann.goldberg/contention.html
Greenberg, A., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32(3), 589–596 (1985)
Hayes, J.: An adaptive technique for local distribution. IEEE Trans. Commun. 26(8), 1178–1186 (1978)
Koutsoupias, E., Papakonstantinopoulou, K.: Contention issues in congestion games. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 623–635. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31585-5_55
Ma, R.T., Misra, V., Rubenstein, D.: Modeling and analysis of generalized slotted-aloha MAC protocols in cooperative, competitive and adversarial environments. In: ICDCS 2006, p. 62. IEEE, Washington, DC, USA (2006)
MacKenzie, P.D., Plaxton, C.G., Rajaraman, R.: On contention resolution protocols and associated probabilistic phenomena. J. ACM 45(2), 324–378 (1998)
Menache, I., Shimkin, N.: Efficient rate-constrained nash equilibrium in collision channels with state information. In: INFOCOM 2008, pp. 403–411 (2008)
Raghavan, P., Upfal, E.: Stochastic contention resolution with short delays. Technical report, Weizmann Science Press of Israel, Jerusalem, Israel (1995)
Roberts, L.: Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev. 5(2), 28–42 (1975)
Sheldon, R.: A First Course in Probability. Pearson, London (2012)
Tobagi, F.A., Kleinrock, L.: Packet switching in radio channels: part II-the hidden terminal problem in carrier sense multiple-access and the busy-tone solution. IEEE Trans. Commun. 23(12), 1417–1433 (1975)
Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Probl. Inf. Transm. 14(4), 259–280 (1978)
Wang, D., Comaniciu, C., Tureli, U.: Cooperation and fairness for slotted aloha. Wirel. Pers. Commun. 43(1), 13–27 (2007)
Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach. In: MobiHoc 2007, pp. 1–10. ACM (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Christodoulou, G., Gairing, M., Nikoletseas, S., Raptopoulos, C., Spirakis, P. (2017). A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. In: Bilò, V., Flammini, M. (eds) Algorithmic Game Theory. SAGT 2017. Lecture Notes in Computer Science(), vol 10504. Springer, Cham. https://doi.org/10.1007/978-3-319-66700-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-66700-3_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66699-0
Online ISBN: 978-3-319-66700-3
eBook Packages: Computer ScienceComputer Science (R0)