• 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 - Request a copy

On Simplified Group Activity Selection

Darmann, Andreas; Döcker, Janosch; Dorn, Britta; Lang, Jérôme; Schneckenburger, Sebastian (2017), On Simplified Group Activity Selection, in Rothe, Jörg, Algorithmic Decision Theory 5th International Conference (ADT 2017), Springer International Publishing : Cham, p. 255-269. 10.1007/978-3-319-67504-6_18

Type
Communication / Conférence
Date
2017
Conference title
5th International Conference on Algorithmic Decision Theory (ADT 2017)
Conference date
2017-10
Conference city
Luxembourg
Conference country
Luxembourg
Book title
Algorithmic Decision Theory 5th International Conference (ADT 2017)
Book author
Rothe, Jörg
Publisher
Springer International Publishing
Published in
Cham
ISBN
978-3-319-67503-9
Number of pages
390
Pages
255-269
Publication identifier
10.1007/978-3-319-67504-6_18
Metadata
Show full item record
Author(s)
Darmann, Andreas
autre
Döcker, Janosch
autre
Dorn, Britta
autre
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Schneckenburger, Sebastian
autre
Abstract (EN)
Several real-world situations can be represented in terms of agents that have preferences over activities in which they may participate. Often, the agents can take part in at most one activity (for instance, since these take place simultaneously), and there are additional constraints on the number of agents that can participate in an activity. In such a setting we consider the task of assigning agents to activities in a reasonable way. We introduce the simplified group activity selection problem providing a general yet simple model for a broad variety of settings, and start investigating the case where upper and lower bounds of the groups have to be taken into account. We apply different solution concepts such as envy-freeness and core stability to our setting and provide a computational complexity study for the problem of finding such solutions
Subjects / Keywords
artificial intelligence; multiagent systems

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
    Group activity selection problem with approval preferences 
    Darmann, Andreas; Elkind, Edith; Kurz, Sascha; Lang, Jérôme; Schauer, Joachim; Woeginger, Gerhard (2018) Article accepté pour publication ou publié
  • Thumbnail
    Propositional Update Operators Based on Formula/Literal Dependence 
    Herzig, Andreas; Lang, Jérôme; Marquis, Pierre (2013) Article accepté pour publication ou publié
  • Thumbnail
    Introspective forgetting 
    van Ditmarsch, Hans; Herzig, Andreas; Lang, Jérôme; Marquis, Pierre (2009) Article accepté pour publication ou publié
  • Thumbnail
    Introspective Forgetting 
    van Ditmarsch, Hans; Herzig, Andreas; Lang, Jérôme; Marquis, Pierre (2008) 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