{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:26Z","timestamp":1725558926627},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_36","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"430-441","source":"Crossref","is-referenced-by-count":1,"title":["Contention Resolution under Selfishness"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[]},{"given":"Evangelia","family":"Pyrga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","first-page":"281","volume-title":"Proceedings of the Fall Joint Computer Conference","author":"N. Abramson","year":"1970","unstructured":"Abramson, N.: The ALOHA system: Another alternative for computer communications. In: Proceedings of the Fall Joint Computer Conference, November 17-19, pp. 281\u2013285. ACM, New York (1970)"},{"issue":"6","key":"36_CR2","doi-asserted-by":"publisher","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.\u00a045(6), 701\u2013713 (2004)","journal-title":"Comput. Netw."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Altman, E., Barman, D., Benslimane, A., El Azouzi, R.: Slotted aloha with priorities and random power. In: Proc. IEEE Infocom (2005)","DOI":"10.1007\/11422778_49"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-92185-1_34","volume-title":"Internet and Network Economics","author":"V. Auletta","year":"2008","unstructured":"Auletta, V., Moscardelli, L., Penna, P., Persiano, G.: Interference games in wireless networks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 278\u2013285. Springer, Heidelberg (2008)"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/1073970.1074023","volume-title":"SPAA 2005","author":"M. Bender","year":"2005","unstructured":"Bender, M., Farach-Colton, M., He, S., Kuszmaul, B., Leiserson, C.: Adversarial contention resolution for simple channels. In: SPAA 2005, pp. 325\u2013332. ACM, New York (2005)"},{"issue":"10","key":"36_CR6","doi-asserted-by":"publisher","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 Transactions on Communications\u00a027(10), 1476\u20131484 (1979)","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"36_CR7","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a025(5), 505\u2013515 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"key":"36_CR8","first-page":"179","volume-title":"SODA 2007","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents. In: SODA 2007, pp. 179\u2013188. SIAM, Philadelphia (2007)"},{"key":"36_CR9","doi-asserted-by":"publisher","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 Transactions on Communications\u00a0COM-30, 2413\u20132420 (1982)","journal-title":"IEEE Transactions on Communications"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/140901.140906","volume-title":"SPAA 1992","author":"M. Ger\u00e9b-Graus","year":"1992","unstructured":"Ger\u00e9b-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: SPAA 1992, pp. 41\u201348. ACM, New York (1992)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","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.\u00a058(1), 232\u2013258 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"36_CR12","doi-asserted-by":"publisher","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\u00a047(6), 1048\u20131096 (2000)","journal-title":"J. ACM"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A. Greenberg","year":"1985","unstructured":"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\u00a032(3), 589\u2013596 (1985)","journal-title":"J. ACM"},{"issue":"8","key":"36_CR14","doi-asserted-by":"publisher","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 Transactions on Communications\u00a026(8), 1178\u20131186 (1978)","journal-title":"IEEE Transactions on Communications"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"36_CR16","first-page":"62","volume-title":"ICDCS 2006","author":"R.T. Ma","year":"2006","unstructured":"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, Washington, DC, USA, p. 62. IEEE, Los Alamitos (2006)"},{"key":"36_CR17","unstructured":"MacKenzie, A., Wicker, S.: Stability of multipacket slotted aloha with selfish users and perfect information (2003)"},{"issue":"2","key":"36_CR18","doi-asserted-by":"publisher","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\u00a045(2), 324\u2013378 (1998)","journal-title":"J. ACM"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Menache, I., Shimkin, N.: Efficient rate-constrained nash equilibrium in collision channels with state information. In: INFOCOM 2008, pp. 403\u2013411 (2008)","DOI":"10.1109\/INFOCOM.2008.87"},{"issue":"2","key":"36_CR20","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a027(2), 145\u2013151 (1981)","journal-title":"IEEE Transactions on Information Theory"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Stochastic contention resolution with short delays. Technical report, Weizmann Science Press of Israel, Jerusalem, Israel, Israel (1995)","DOI":"10.1145\/225058.225129"},{"issue":"2","key":"36_CR22","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1024916.1024920","volume":"5","author":"L. Roberts","year":"1975","unstructured":"Roberts, L.: Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev.\u00a05(2), 28\u201342 (1975)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"36_CR23","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/18.567769","volume":"43","author":"M. Ruszinko","year":"1997","unstructured":"Ruszinko, M., 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 Transactions on Information Theory\u00a043(1), 368\u2013372 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"36_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/COMST.2005.1593279","volume":"7","author":"V. Srivastava","year":"2005","unstructured":"Srivastava, V., Neel, J.A., MacKenzie, A.B., Hicks, J.E., DaSilva, L.A., Reed, J.H., Gilles, R.P.: Using game theory to analyze wireless ad hoc networks. IEEE Communications Surveys and Tutorials\u00a07(5), 46\u201356 (2005)","journal-title":"IEEE Communications Surveys and Tutorials"},{"key":"36_CR25","unstructured":"Tsybakov, B.: Resolution of a conflict of known multiplicity. Problemy Peredachi Informatsii (1980)"},{"issue":"4","key":"36_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. Problems of Information Transmission\u00a014(4), 259\u2013280 (1978)","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"36_CR27","doi-asserted-by":"publisher","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.\u00a043(1), 13\u201327 (2007)","journal-title":"Wirel. Pers. Commun."},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1288107.1288109","volume-title":"MobiHoc 2007","author":"D. Zheng","year":"2007","unstructured":"Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach. In: MobiHoc 2007, pp. 1\u201310. ACM, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:11Z","timestamp":1606186091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}