Thumbnail

Hedonic Games with Ordinal Preferences and Thresholds

Kerkmann, Anna Maria; Lang, Jérôme; Rey, Anja; Rothe, Jorg; Schadrack, Hilmar; Schend, Lena (2019), Hedonic Games with Ordinal Preferences and Thresholds, Journal of Artificial Intelligence Research, 67, p. 705-756. 10.1613/jair.1.11531

View/Open
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Journal of Artificial Intelligence Research
Number
67
Pages
705-756
Publication identifier
Metadata
Show full item record
Author(s)
Kerkmann, Anna Maria
Institut für Informatik [Düsseldorf]
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Rey, Anja
Fakultät für Informatik, TU Dortmund
Rothe, Jorg
Institut für Informatik [Düsseldorf]
Schadrack, Hilmar
Institut für Informatik [Düsseldorf]
Schend, Lena
Institut für Informatik [Düsseldorf]
Abstract (EN)
We propose a new representation setting for hedonic games, where each agent partitions the set of other agents into friends, enemies, and neutral agents, with friends and enemies being ranked. Under the assumption that preferences are monotonic (respectively, antimonotonic) with respect to the addition of friends (respectively, enemies), we propose a bipolar extension of the responsive extension principle, and use this principle to derive the (partial) preferences of agents over coalitions. Then, for a number of solution concepts, we characterize partitions that necessarily or possibly satisfy them, and we study the related problems in terms of their complexity.
Subjects / Keywords
game theory; multiagent systems; mathematical foundations