{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:48:32Z","timestamp":1710254912677},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T00:00:00Z","timestamp":1365638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00453-013-9773-4","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T19:04:43Z","timestamp":1365620683000},"page":"675-693","source":"Crossref","is-referenced-by-count":3,"title":["Contention Resolution under Selfishness"],"prefix":"10.1007","volume":"70","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelia","family":"Pyrga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"9773_CR1","first-page":"281","volume-title":"AFIPS \u201970","author":"N. Abramson","year":"1970","unstructured":"Abramson, N.: The ALOHA system: another alternative for computer communications. In: AFIPS \u201970, November 17\u201319, 1970, pp. 281\u2013285. ACM, New York (1970)"},{"issue":"6","key":"9773_CR2","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.comnet.2004.02.013","volume":"45","author":"E. Altman","year":"2004","unstructured":"Altman, E., El Azouzi, R., Jim\u00e9nez, T.: Slotted aloha as a game with partial information. Comput. Netw. 45(6), 701\u2013713 (2004)","journal-title":"Comput. Netw."},{"key":"9773_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/11422778_49","volume-title":"NETWORKING","author":"E. Altman","year":"2005","unstructured":"Altman, E., Barman, D., Benslimane, A., El Azouzi, R.: Slotted aloha with priorities and random power. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S.X., Black, J.P. (eds.) NETWORKING. Lecture Notes in Computer Science, vol. 3462 pp. 610\u2013622. Springer, Berlin (2005)"},{"key":"9773_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-92185-1_34","volume-title":"WINE","author":"V. Auletta","year":"2008","unstructured":"Auletta, V., Moscardelli, L., Penna, P., Persiano, G.: Interference games in wireless networks. In: Papadimitriou, C.H., Zhang, S. (eds.) WINE. Lecture Notes in Computer Science, vol. 5385, pp. 278\u2013285. Springer, Berlin (2008)"},{"key":"9773_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/1073970.1074023","volume-title":"SPAA \u201905","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Gibbons, P.B., Spirakis, P.G. (eds.) SPAA \u201905, pp. 325\u2013332. ACM, New York (2005)"},{"issue":"5","key":"9773_CR6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J. Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25(5), 505\u2013515 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"9773_CR7","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TCOM.1979.1094298","volume":"27","author":"J. Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Generalized TDMA: the multi-accessing tree protocol. IEEE Trans. Commun. 27(10), 1476\u20131484 (1979)","journal-title":"IEEE Trans. Commun."},{"key":"9773_CR8","first-page":"179","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201907","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201907, pp. 179\u2013188. SIAM, Philadelphia (2007)"},{"key":"9773_CR9","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1109\/TCOM.1982.1095438","volume":"30","author":"L. Georgiadis","year":"1982","unstructured":"Georgiadis, L., Papantoni-Kazakos, P.: A collision resolution protocol for random access channels with energy detectors. IEEE Trans. Commun. 30, 2413 (1982)","journal-title":"IEEE Trans. Commun."},{"key":"9773_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/140901.140906","volume-title":"SPAA \u201992","author":"M. Ger\u00e9b-Graus","year":"1992","unstructured":"Ger\u00e9b-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: SPAA \u201992, pp. 41\u201348. ACM, New York (1992)"},{"issue":"1","key":"9773_CR11","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1006\/jcss.1998.1590","volume":"58","author":"L.A. Goldberg","year":"1999","unstructured":"Goldberg, L.A., Mackenzie, P.D.: Analysis of practical backoff protocols for contention resolution with multiple servers. J. Comput. Syst. Sci. 58(1), 232\u2013258 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"9773_CR12","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/355541.355567","volume":"47","author":"L.A. Goldberg","year":"2000","unstructured":"Goldberg, L.A., Mackenzie, P.D., Paterson, M., Srinivasan, A.: Contention resolution with constant expected delay. J. ACM 47(6), 1048\u20131096 (2000)","journal-title":"J. ACM"},{"issue":"3","key":"9773_CR13","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A.G. Greenberg","year":"1985","unstructured":"Greenberg, A.G., 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\u2013596 (1985)","journal-title":"J. ACM"},{"issue":"8","key":"9773_CR14","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","volume":"26","author":"J. Hayes","year":"1978","unstructured":"Hayes, J.: An adaptive technique for local distribution. IEEE Trans. Commun. 26(8), 1178\u20131186 (1978)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"9773_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9773_CR16","first-page":"62","volume-title":"The 26th International Conference on Distributed Computing Systems (ICDCS 06)","author":"R.T.B. Ma","year":"2006","unstructured":"Ma, R.T.B., Misra, V., Rubenstein, D.: Modeling and analysis of generalized slotted-aloha mac protocols in cooperative, competitive and adversarial environments. In: The 26th International Conference on Distributed Computing Systems (ICDCS 06), p. 62. IEEE, Washington (2006)"},{"key":"9773_CR17","unstructured":"MacKenzie, A.B., Wicker, S.B.: Stability of multipacket slotted aloha with selfish users and perfect information (2003)"},{"issue":"2","key":"9773_CR18","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/274787.274816","volume":"45","author":"P.D. MacKenzie","year":"1998","unstructured":"MacKenzie, P.D., Plaxton, C.G., Rajaraman, R.: On contention resolution protocols and associated probabilistic phenomena. J. ACM 45(2), 324\u2013378 (1998)","journal-title":"J. ACM"},{"key":"9773_CR19","first-page":"403","volume-title":"INFOCOM 2008","author":"I. Menache","year":"2008","unstructured":"Menache, I., Shimkin, N.: Efficient rate-constrained Nash equilibrium in collision channels with state information. In: INFOCOM 2008, pp. 403\u2013411 (2008)"},{"issue":"2","key":"9773_CR20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TIT.1981.1056332","volume":"27","author":"N. Pippenger","year":"1981","unstructured":"Pippenger, N.: Bounds on the performance of protocols for a multiple-access broadcast channel. IEEE Trans. Inf. Theory 27(2), 145\u2013151 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9773_CR21","first-page":"229","volume-title":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201995","author":"R. Prabhakar","year":"1995","unstructured":"Prabhakar, R., Upfal, E.: Stochastic contention resolution with short delays. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201995, pp. 229\u2013237. ACM, New York (1995)"},{"issue":"2","key":"9773_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1024916.1024920","volume":"5","author":"L.G. Roberts","year":"1975","unstructured":"Roberts, L.G.: Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev. 5(2), 28\u201342 (1975)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"9773_CR23","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/18.567769","volume":"43","author":"R. Miklos","year":"1997","unstructured":"Miklos, R., Vanroose, P.: How an Erd\u00f6os-R\u00e9nyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback. IEEE Trans. Inf. Theory 43(1), 368\u2013372 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9773_CR24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/COMST.2005.1593279","volume":"7","author":"V. Srivastava","year":"2005","unstructured":"Srivastava, V., Neel, J.O., MacKenzie, A.B., Menon, R., DaSilva, L.A., Hicks, J.E., Reed, J.H., Gilles, R.P.: Using game theory to analyze wireless ad hoc networks. IEEE Commun. Surv. Tutor. 7(5), 46\u201356 (2005)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"9773_CR25","unstructured":"Tsybakov, B.: Resolution of a conflict of known multiplicity. Problemy Peredachi Informatsii (1980)"},{"issue":"4","key":"9773_CR26","first-page":"259","volume":"14","author":"B.S. Tsybakov","year":"1978","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Probl. Inf. Transm. 14(4), 259\u2013280 (1978)","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"9773_CR27","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s11277-006-9240-5","volume":"43","author":"D. Wang","year":"2007","unstructured":"Wang, D., Comaniciu, C., Tureli, U.: Cooperation and fairness for slotted aloha. Wirel. Pers. Commun. 43(1), 13\u201327 (2007)","journal-title":"Wirel. Pers. Commun."},{"key":"9773_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1288107.1288109","volume-title":"Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc \u201907","author":"D. Zheng","year":"2007","unstructured":"Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc \u201907, pp. 1\u201310. ACM, New York (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9773-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9773-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9773-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9773-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,11]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9773"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9773-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,11]]}}}