Adversarial Contention Resolution Games

Giorgos Chionas; Bogdan S. Chlebus; Dariusz R. Kowalski; Piotr Krysta

IJCAI 2023poster1 citations

Adversarial Contention Resolution Games

Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta

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.

Game Theory and Economic Paradigms: GTEP: Noncooperative gamesAgent-based and Multi-agent Systems: MAS: Agent theories and modelsGame Theory and Economic Paradigms: GTEP: Mechanism design

BibTeX

@inproceedings{ijcai2023p289,
  title     = {Adversarial Contention Resolution Games},
  author    = {Chionas, Giorgos and Chlebus, Bogdan S. and Kowalski, Dariusz R. and Krysta, Piotr},
  booktitle = {Proceedings of the Thirty-Second International Joint Conference on
               Artificial Intelligence, {IJCAI-23}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Edith Elkind},
  pages     = {2598--2606},
  year      = {2023},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2023/289},
  url       = {https://doi.org/10.24963/ijcai.2023/289},
}