Show simple item record

hal.structure.identifier
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorGourvès, Laurent*
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
hal.structure.identifier
dc.contributor.authorTlilane, Lydia*
hal.structure.identifier
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorMonnot, Jérôme
HAL ID: 178759
ORCID: 0000-0002-7452-6553
*
dc.date.accessioned2015-04-14T17:19:57Z
dc.date.available2015-04-14T17:19:57Z
dc.date.issued2014
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/14934
dc.language.isoenen
dc.subjectfair allocation
dc.subjectindivisible goods
dc.subjectmatroids
dc.subject.ddc006.3en
dc.titleNear Fairness in Matroids
dc.typeCommunication / Conférence
dc.description.abstractenThis article deals with the fair allocation of indivisible goods and its generalization to matroids. The notions of fairness under consideration are equitability, proportionality and envy-freeness. It is long known that some instances fail to admit a fair allocation. However, an almost fair solution may exist if an appropriate relaxation of the fairness condition is adopted. This article deals with a matroid problem which comprises the allocation of indivisible goods as a special case. It is to find a base of a matroid and to allocate it to a pool of agents. We first adapt the aforementioned fairness concepts to matroids. Next we propose a relaxed notion of fairness said to be near to fairness. Near fairness respects the fairness up to one element. We show that a nearly fair solution always exists and it can be constructed in polynomial time in the general context of matroids.
dc.identifier.citationpages393-398
dc.relation.ispartoftitleECAI 2014 : 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic : including Prestigious Applications of Artificial Intelligence (PAIS 2014), Systems : proceedings
dc.relation.ispartofeditorSchaub, Torsten
dc.relation.ispartofpublnameIOS Press
dc.relation.ispartofpublcityTokyo
dc.relation.ispartofdate2014
dc.subject.ddclabelIntelligence artificielleen
dc.relation.ispartofisbn978-1-61499-418-3
dc.relation.conftitleECAI 2014
dc.relation.confdate2014-08
dc.relation.confcityPrague
dc.relation.confcountryCzech Republic
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewednon
dc.date.updated2016-03-22T14:41:02Z
hal.identifierhal-01292166*
hal.version1*
hal.update.actionupdateMetadata*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record