Ordinal Graph-Based Games - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Ordinal Graph-Based Games

Résumé

The graphical, hypergraphical and polymatrix games frameworks provide concise representations of non-cooperative normal-form games involving many agents. In these graph-based games, agents interact in simultaneous local subgames with the agents which are their neighbors in a graph. Recently, ordinal normal form games have been proposed as a framework for game theory where agents' utilities are ordinal. This paper presents the first definition of Ordinal Graphical Games (OGG), Ordinal Hypergraphical Games (OHG), and Ordinal Polymatrix Games (OPG). We show that, as for classical graph-based games, determining whether a pure NE exists is also NP-hard. We propose an original CSP model to decide their existence and compute them. Then, a polynomial-time algorithm to compute possibilistic mixed equilibria for graph-based games is proposed. Finally, the experimental study is dedicated to test our proposed solution concepts for ordinal graph-based games.
Fichier principal
Vignette du fichier
Azzabi2020_Chapter_OrdinalGraph-BasedGames.pdf (425.31 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02865988 , version 1 (10-11-2020)

Identifiants

Citer

Arij Azzabi, Nahla Ben Amor, Hélène Fargier, Régis Sabbadin. Ordinal Graph-Based Games. 18th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2020), Jun 2020, Lisboa, Portugal. pp.271-285, ⟨10.1007/978-3-030-50146-4_21⟩. ⟨hal-02865988⟩
97 Consultations
144 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More