• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
11531-Article_(PDF)-23295-1-10-20200405.pdf (353.0Kb)
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Journal of Artificial Intelligence Research
Number
67
Pages
705-756
Publication identifier
10.1613/jair.1.11531
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

Related items

Showing items related by title and author.

  • Thumbnail
    Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds 
    Lang, Jérôme; Rey, Anja; Rothe, Jörg; Schadrack, Hilmar; Schend, Lena (2015) Communication / Conférence
  • Thumbnail
    Winner determination in voting trees with incomplete preferences and weighted votes 
    Lang, Jérôme; Pini, Maria Silvia; Rossi, Francesca; Salvagnin, Domenico; Venable, Kristen Brent; Walsh, Toby (2012) Article accepté pour publication ou publié
  • Thumbnail
    Optimal Reallocation under Additive and Ordinal Preferences 
    Aziz, Haris; Biro, Peter; Lang, Jérôme; Lesca, Julien; Monnot, Jérôme (2016) Communication / Conférence
  • Thumbnail
    Graphical Representation of Ordinal Preferences: Languages and Applications 
    Lang, Jérôme (2010) Communication / Conférence
  • Thumbnail
    Portioning Using Ordinal Preferences: Fairness and Efficiency 
    Airiau, Stéphane; Aziz, Haris; Caragiannis, Ioannis; Lang, Jérôme; Peters, Dominik; Kruger, Justin (2019) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo