Adversarial Contention Resolution Games
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.
Cite
Text
Chionas et al. "Adversarial Contention Resolution Games." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/289Markdown
[Chionas et al. "Adversarial Contention Resolution Games." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/chionas2023ijcai-adversarial/) doi:10.24963/IJCAI.2023/289BibTeX
@inproceedings{chionas2023ijcai-adversarial,
title = {{Adversarial Contention Resolution Games}},
author = {Chionas, Giorgos and Chlebus, Bogdan S. and Kowalski, Dariusz R. and Krysta, Piotr},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2023},
pages = {2598-2606},
doi = {10.24963/IJCAI.2023/289},
url = {https://mlanthology.org/ijcai/2023/chionas2023ijcai-adversarial/}
}