Show simple item record

dc.contributor.authorDarmann, Andreas
dc.contributor.authorElkind, Edith
dc.contributor.authorKurz, Sascha
dc.contributor.authorLang, Jérôme
dc.contributor.authorSchauer, Joachim
dc.contributor.authorWoeginger, Gerhard
dc.date.accessioned2019-07-04T08:03:58Z
dc.date.available2019-07-04T08:03:58Z
dc.date.issued2018
dc.identifier.issn2224-1981
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/19151
dc.language.isoenen
dc.subjectHedonic gamesen
dc.subjectGASPen
dc.subjectComplexityen
dc.subjectApproval preferencesen
dc.subject.ddc519en
dc.titleGroup activity selection problem with approval preferencesen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe 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.en
dc.relation.isversionofjnlnameInternational Journal of Game Theory
dc.relation.isversionofjnlvol47en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2018-09
dc.relation.isversionofjnlpages767-796en
dc.relation.isversionofdoi10.1007/s00182-017-0596-4en
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelProbabilités et mathématiques appliquéesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2019-03-28T11:39:18Z
hal.person.labIds115536
hal.person.labIds91201
hal.person.labIds152786
hal.person.labIds989
hal.person.labIds115536
hal.person.labIds109169
hal.identifierhal-02172783*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record