• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds

Thumbnail
View/Open
p1229.pdf (523.1Kb)
Date
2015
Dewey
Intelligence artificielle
Sujet
Computational Social Choice; Coalition Formation; Game Theory
Conference name
14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '15)
Conference date
05-2015
Conference city
Istanbul
Conference country
Turkey
Book title
AAMAS '15 Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems
Author
Bordini, Rafael H.; Elkind, Edith; Weiss, Gerhard; Yolum, Pinar
Publisher
IFAAMAS
Publisher city
Richland
Year
2015
Pages number
2022
ISBN
978-1-4503-3413-6
URI
https://basepub.dauphine.fr/handle/123456789/16464
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Rey, Anja
status unknown
Rothe, Jörg
status unknown
Schadrack, Hilmar
status unknown
Schend, Lena
status unknown
Type
Communication / Conférence
Item number of pages
1229-1237
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 Bossong-Schweigert 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 (respectively, possibly) satisfy them, and identify the computational complexity of the associated decision problems. Alternatively, we suggest cardinal comparability functions in order to extend to complete preference orders consistent with the generalized Bossong-Schweigert order.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.