Show simple item record

Generalized additive games

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorCesari, Giulia
hal.structure.identifier
dc.contributor.authorLucchetti, Roberto
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorMoretti, Stefano
HAL ID: 739814
ORCID: 0000-0003-3627-3257
dc.date.accessioned2017-11-07T16:40:21Z
dc.date.available2017-11-07T16:40:21Z
dc.date.issued2017
dc.identifier.issn2224-1981
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16929
dc.language.isoenen
dc.subjectTU-gamesen
dc.subjectCoreen
dc.subjectSemivaluesen
dc.subjectAirport gamesen
dc.subjectPeer gamesen
dc.subjectArgumentation gamesen
dc.subject.ddc519en
dc.titleGeneralized additive gamesen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenA transferable utility (TU) game with n players specifies a vector of 2n−12n−1 real numbers, i.e. a number for each non-empty coalition, and this can be difficult to handle for large n. Therefore, several models from the literature focus on interaction situations which are characterized by a compact representation of a TU-game, and such that the worth of each coalition can be easily computed. Sometimes, the worth of each coalition is computed from the values of single players by means of a mechanism describing how the individual abilities interact within groups of players. In this paper we introduce the class of Generalized additive games (GAGs), where the worth of a coalition S⊆NS⊆N is evaluated by means of an interaction filter, that is a map MM which returns the valuable players involved in the cooperation among players in S. Moreover, we investigate the subclass of basic GAGs, where the filter MM selects, for each coalition S, those players that have friends but not enemies in S. We show that well-known classes of TU-games can be represented in terms of such basic GAGs, and we investigate the problem of computing the core and the semivalues for specific families of GAGs.en
dc.relation.isversionofjnlnameInternational Journal of Game Theory
dc.relation.isversionofjnlvol46en
dc.relation.isversionofjnlissue4en
dc.relation.isversionofjnldate2017-11
dc.relation.isversionofjnlpages919-939en
dc.relation.isversionofdoi10.1007/s00182-016-0561-7en
dc.relation.isversionofjnlpublisherPergamonen
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.updated2017-11-07T16:28:04Z
hal.identifierhal-01630561*
hal.version1*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record