Adversarial Contention Resolution Games

Chionas, Giorgos ORCID: 0000-0003-2993-8636, Chlebus, Bogdan S, Kowalski, Dariusz R and Krysta, Piotr (2023) Adversarial Contention Resolution Games. In: Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}, 2023-8-19 - 2023-8-25, Macau, China.

Text Adversarial_Contention_Resolution_Games.pdf - Author Accepted Manuscript Download (329kB) | Preview

Abstract

<jats:p>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.</jats:p>

Item Type:	Conference or Workshop Item (Unspecified)
Divisions:	Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User:	Symplectic Admin
Date Deposited:	13 Jun 2023 15:37
Last Modified:	15 Mar 2024 14:52
DOI:	10.24963/ijcai.2023/289
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3170928