• 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

Group activity selection problem with approval preferences

Darmann, Andreas; Elkind, Edith; Kurz, Sascha; Lang, Jérôme; Schauer, Joachim; Woeginger, Gerhard (2018), Group activity selection problem with approval preferences, International Journal of Game Theory, 47, 3, p. 767-796. 10.1007/s00182-017-0596-4

View/Open
Darmann2018_Article.pdf (608.7Kb)
Type
Article accepté pour publication ou publié
Date
2018
Journal name
International Journal of Game Theory
Volume
47
Number
3
Publisher
Springer
Pages
767-796
Publication identifier
10.1007/s00182-017-0596-4
Metadata
Show full item record
Author(s)
Darmann, Andreas
autre
Elkind, Edith
Computing Science Laboratory - Oxford University
Kurz, Sascha
Mathematisches Institut [Bayreuth]
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Schauer, Joachim
autre
Woeginger, Gerhard
Department of Computer Science [Aachen]
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.
Subjects / Keywords
Hedonic games; GASP; Complexity; Approval preferences

Related items

Showing items related by title and author.

  • Thumbnail
    Group Activity Selection Problem 
    Darmann, Andreas; Elkind, Edith; Kurz, Sascha; Lang, Jérôme; Schauer, Joachim; Woeginger, Gerhard (2012) Communication / Conférence
  • Thumbnail
    On Simplified Group Activity Selection 
    Darmann, Andreas; Döcker, Janosch; Dorn, Britta; Lang, Jérôme; Schneckenburger, Sebastian (2017) Communication / Conférence
  • Thumbnail
    Local search for the minimum label spanning tree problem with bounded color classes 
    Bruggemann, Tobias; Monnot, Jérôme; Woeginger, Gerhard (2003) Article accepté pour publication ou publié
  • Thumbnail
    Condorcet winning sets 
    Elkind, Edith; Lang, Jérôme; Saffidine, Abdallah (2015) Article accepté pour publication ou publié
  • Thumbnail
    Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion 
    Elkind, Edith; Lang, Jérôme; Saffidine, Abdallah (2011) 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