• 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

Group activity selection problem with approval preferences

Thumbnail
View/Open
Darmann2018_Article.pdf (608.7Kb)
Date
2018
Dewey
Probabilités et mathématiques appliquées
Sujet
Hedonic games; GASP; Complexity; Approval preferences
Journal issue
International Journal of Game Theory
Volume
47
Number
3
Publication date
09-2018
Article pages
767-796
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s00182-017-0596-4
URI
https://basepub.dauphine.fr/handle/123456789/19151
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Darmann, Andreas
115536 autre
Elkind, Edith
91201 Computing Science Laboratory - Oxford University
Kurz, Sascha
152786 Mathematisches Institut [Bayreuth]
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Schauer, Joachim
115536 autre
Woeginger, Gerhard
109169 Department of Computer Science [Aachen]
Type
Article accepté pour publication ou publié
Abstract (EN)
We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences in a way that is socially optimal and/or stable. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model where agents’ preferences are binary, i.e., each agent classifies all pairs of the form ‘(activity, group size)’ into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents’ preferences satisfy certain natural constraints.

  • 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.