{"type":"ScholarlyArticle","title":"Adversarial Contention Resolution Games","authors":[{"name":"Giorgos Chionas","slug":"giorgos-chionas","given":"Giorgos","family":"Chionas","affiliation":"Department of Computer Science , University of Liverpool , UK"},{"name":"Bogdan S. Chlebus","slug":"bogdan-s-chlebus","given":"Bogdan S.","family":"Chlebus","affiliation":"School of Computer and Cyber Sciences , Augusta University , GA , USA"},{"name":"Dariusz R. Kowalski","slug":"dariusz-r-kowalski","given":"Dariusz R.","family":"Kowalski","affiliation":"School of Computer and Cyber Sciences , Augusta University , GA , USA"},{"name":"Piotr Krysta","slug":"piotr-krysta","given":"Piotr","family":"Krysta","affiliation":"Department of Computer Science , University of Liverpool , UK"}],"abstract":"We study contention resolution (CR) on a shared channel modelled as a game with selfish players. There are n agents and the adversary chooses some k smaller than n of them as players. Each participating player in a CR game has a packet to transmit. A transmission is successful if it is performed as the only one at a round. Each player aims to minimize its packet latency. We introduce the notion of adversarial equilibrium (AE), which incorporates adversarial selection of players. We develop efficient deterministic communication algorithms that are also AE. We characterize the price of anarchy in the CR games with respect to AE.","doi":"10.24963/ijcai.2023/289","url":"https://ijcai.org/proceedings/2023/289","pdf":"https://ijcai.org/proceedings/2023/0289.pdf","markdown":"https://ijcai.org/proceedings/2023/289.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/289","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":289,"pages":{"first":2598,"last":2606},"keywords":["Game Theory and Economic Paradigms: GTEP: Mechanism design","Agent-based and Multi-agent Systems: MAS: Agent theories and models","Game Theory and Economic Paradigms: GTEP: Noncooperative games"],"videos":[],"references":[{"position":1,"raw":"[Abramson, 1970] Norman M. Abramson. The ALOHA sys- tem: Another alternative for computer communications. In Proceedings of the 1970 Fall Joint Computer Conference (AFIPS), pages 281-285. ACM, 1970.","title":"The ALOHA system: Another alternative for computer communications","authors":"Norman M Abramson","year":"1970","venue":"Proceedings of the 1970 Fall Joint Computer Conference (AFIPS)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Anantharamu et al., 2019] Lakshmi Anantharamu, Bog- dan S. Chlebus, Dariusz R. Kowalski, and Mariusz A. Ro- kicki. Packet latency of deterministic broadcasting in ad- versarial multiple access channels. Journal of Computer and System Sciences, 99:27-52, 2019.","title":"Packet latency of deterministic broadcasting in adversarial multiple access channels","authors":"Lakshmi Anantharamu, Bogdan S Chlebus, R Dariusz, Mariusz A Kowalski, Rokicki","year":"2019","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Anshelevich et al., 2004] Elliot Anshelevich, Anirban Das- gupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The price of stability for network de- sign with fair cost allocation. 45th Annual IEEE Sym- posium on Foundations of Computer Science, pages 295- 304, 2004.","title":"The price of stability for network design with fair cost allocation","authors":"Elliot Anshelevich, Anirban Dasgupta, Jon M Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden","year":"2004","venue":"45th Annual IEEE Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Axelrod and Hamilton, 1981] Robert Axelrod and William D. Hamilton. The evolution of cooperation. Science, 211(4489):1390-1396, 1981.","title":"The evolution of cooperation","authors":"Robert Axelrod, William D Hamilton","year":"1981","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bender et al., 2005] Michael A. Bender, Martin Farach- Colton, Simai He, Bradley C. Kuszmaul, and Charles E. Leiserson. Adversarial contention resolution for simple channels. In Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 325- 332, 2005.","title":"Adversarial contention resolution for simple channels","authors":"A Michael, Martin Bender, Simai Farach-Colton, Bradley C He, Charles E Kuszmaul, Leiserson","year":"2005","venue":"Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chlebus and Kowalski, 2005] Bogdan S. Chlebus and Dar- iusz R. Kowalski. Almost optimal explicit selectors. In Proceedings of the 15th International Symposium on Fun- damentals of Computation Theory (FCT), volume 3623 of Lecture Notes in Computer Science, pages 270-280. Springer, 2005.","title":"Almost optimal explicit selectors","authors":"Bogdan S Chlebus, Dariusz R Kowalski","year":"2005","venue":"Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chlebus et al., 2012] Bogdan S. Chlebus, Dariusz R. Kowalski, and Mariusz A. Rokicki. Adversarial queuing on the multiple access channel. ACM Transactions on Al- gorithms, 8(1):5:1-5:31, 2012.","title":"Adversarial queuing on the multiple access channel","authors":"Bogdan S Chlebus, R Dariusz, Mariusz A Kowalski, Rokicki","year":"2012","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chlebus, 2001] Bogdan S. Chlebus. Randomized communi- cation in radio networks. In Panos M. Pardalos, Sanguthe- var Rajasekaran, John H. Reif, and Jose D. P. Rolim, editors, Handbook of Randomized Computing, volume I, pages 401-456. Kluwer Academic Publishers, 2001.","title":"Randomized communication in radio networks","authors":"Bogdan S Chlebus","year":"2001","venue":"Handbook of Randomized Computing","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Christodoulou et al., 2014] George Christodoulou, Katrina Ligett, and Evangelia Pyrga. Contention resolution under selfishness. Algorithmica, 70(4):675-693, 2014.","title":"Contention resolution under selfishness","authors":"George Christodoulou, Katrina Ligett, Evangelia Pyrga","year":"2014","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Clementi et al., 2001] Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri. Selective families, su- perimposed codes, and broadcasting on unknown radio networks. In S. Rao Kosaraju, editor, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA), January 7-9, 2001, Washington, DC, USA, pages 709-718. ACM/SIAM, 2001.","title":"Selective families, superimposed codes, and broadcasting on unknown radio networks","authors":"Andrea E F Clementi, Angelo Monti, Riccardo Silvestri","year":"2001","venue":"Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[De Marco and Stachowiak, 2017] Gianluca De Marco and Grzegorz Stachowiak. Asynchronous shared channel. In Proceedings of the ACM Symposium on Principles of Dis- tributed Computing (PODC), pages 391-400. ACM, 2017.","title":"Asynchronous shared channel","authors":"De Marco, Gianluca Stachowiak, Marco De, Grzegorz Stachowiak","year":"2017","venue":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[De Marco et al., 2019] Gianluca De Marco, Dariusz R. Kowalski, and Grzegorz Stachowiak. Deterministic con- tention resolution on a shared channel. In Proceed- ings of the 39th IEEE International Conference on Dis- tributed Computing Systems (ICDCS), pages 472-482. IEEE, 2019.","title":"Deterministic contention resolution on a shared channel","authors":"Gianluca De Marco, Dariusz R Kowalski, Grzegorz Stachowiak","year":"2019","venue":"Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fiat et al., 2007] Amos Fiat, Yishay Mansour, and Uri Na- dav. Efficient contention resolution protocols for selfish agents. In Proceedings of the Eighteenth Annual ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 179-188. SIAM, 2007.","title":"Efficient contention resolution protocols for selfish agents","authors":"Amos Fiat, Yishay Mansour, Uri Nadav","year":"2007","venue":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Greenberg and Winograd, 1985] Albert G. Greenberg and Shmuel Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in mul- tiple access channels. Journal of the ACM, 32(3):589-596, 1985.","title":"A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels","authors":"Albert G Greenberg, Shmuel Winograd","year":"1985","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Griggs et al., 2023] Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, and Michael Schmitz. Sizes of flat maximal antichains of subsets. CoRR, abs/2302.07062, 2023.","title":"Sizes of flat maximal antichains of subsets","authors":"Jerrold R Griggs, Thomas Kalinowski, Uwe Leck, Ian T Roberts, Michael Schmitz","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hradovich et al., 2021] Elijah Hradovich, Marek Klonowski, and Dariusz R. Kowalski. New view on adversarial queueing on MAC. IEEE Communication Letters, 25(4):1144-1148, 2021.","title":"New view on adversarial queueing on MAC","authors":"Hradovich","year":"2021","venue":"IEEE Communication Letters","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Indyk, 2002] Piotr Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the 13th ACM-SIAM Symposium on Dis- crete Algorithms (SODA), pages 697-704, 2002.","title":"Explicit constructions of selectors and related combinatorial structures, with applications","authors":"Piotr Indyk","year":"2002","venue":"Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kautz and Singleton, 1964] William Kautz and Roy Single- ton. Nonrandom binary superimposed codes. IEEE Trans- actions on Information Theory, 10(4):363-377, 1964.","title":"Nonrandom binary superimposed codes","authors":"William Kautz, Roy Singleton","year":"1964","venue":"IEEE Transactions on Information Theory","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Komlós and Greenberg, 1985] János Komlós and Albert G. Greenberg. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory, 31(2):302-306, 1985.","title":"An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels","authors":"Greenberg Komlós, János Komlós, Albert G Greenberg","year":"1985","venue":"IEEE Trans. Inf. Theory","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Koutsoupias and Papadimitriou, 2009] Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. Computer Science Review, 3(2):65-69, 2009.","title":"Elias Koutsoupias and Christos","authors":"Papadimitriou Koutsoupias, H Papadimitriou","year":"2009","venue":"Computer Science Review","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kowalski, 2005] Dariusz R. Kowalski. On selection prob- lem in radio networks. In Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pages 158-166. ACM, 2005.","title":"On selection problem in radio networks","authors":"R Dariusz, Kowalski","year":"2005","venue":"Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Maschler et al., 2020] Michael Maschler, Eilon Solan, and Shmuel Zamir. Game Theory. Cambridge University Press, second edition, 2020.","title":"Game Theory","authors":"Michael Maschler, Eilon Solan, Shmuel Zamir","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Metcalfe and Boggs, 1976] Robert M. Metcalfe and David R. Boggs. Ethernet: Distributed packet switching for local computer networks. Communications of the ACM, 19(7):395-404, 1976.","title":"Ethernet: Distributed packet switching for local computer networks","authors":"Robert M Metcalfe, David R Boggs","year":"1976","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nisan et al., 2007] Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.","title":"Algorithmic Game Theory","authors":"Nisan","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Osborne and Rubinstein, 1994] Martin Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994.","title":"A Course in Game Theory","authors":"Osborne, Rubinstein, Martin Osborne, Ariel Rubinstein","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Porat and Rothschild, 2011] Ely Porat and Amir Roth- schild. Explicit nonadaptive combinatorial group test- ing schemes. IEEE Transactions on Information Theory, 57(12):7982-7989, 2011.","title":"Explicit nonadaptive combinatorial group testing schemes","authors":"Rothschild Porat","year":"2011","venue":"IEEE Transactions on Information Theory","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Ta-Shma et al., 2007] Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Lossless condensers, unbalanced expanders, and extractors. Combinatorica, 27(2):213-240, 2007.","title":"Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Lossless condensers, unbalanced expanders, and extractors","authors":"Ta-Shma","year":"2007","venue":"Combinatorica","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}