Approximate Tradeoffs on Matroids - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Approximate Tradeoffs on Matroids

Résumé

We consider problems where a solution is evaluated with a couple. Each coordinate of this couple represents an agent’s utility. Due to the possible conflicts, it is unlikely that one feasible solution is optimal for both agents. Then, a natural aim is to find tradeoffs. We investigate tradeoff solutions with guarantees for the agents.The focus is on discrete problems having a matroid structure. We provide polynomial-time deterministic algorithms which achieve several guarantees and we prove that some guarantees are not possible to reach.
Fichier principal
Vignette du fichier
Ecai_matroid.pdf (130.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01508731 , version 1 (14-04-2017)

Identifiants

Citer

Laurent Gourvès, Jérôme Monnot, Lydia Tlilane. Approximate Tradeoffs on Matroids. 20th European Conference on Artificial Intelligence (ECAI 2012), Aug 2012, Montpellier, France. pp.360-365, ⟨10.3233/978-1-61499-098-7-360⟩. ⟨hal-01508731⟩
60 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More