Thumbnail

Approximate tradeoffs on weighted labeled matroids

Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2015), Approximate tradeoffs on weighted labeled matroids, Discrete Applied Mathematics, 184, p. 154-166. 10.1016/j.dam.2014.11.005

View/Open
Type
Article accepté pour publication ou publié
Date
2015
Journal name
Discrete Applied Mathematics
Volume
184
Publisher
Elsevier
Pages
154-166
Publication identifier
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Tlilane, Lydia
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We consider problems where a solution is evaluated with a couple. Each coordinate of this couple represents the utility of an agent. Due to the possible conflicts, it is unlikely that one feasible solution is optimal for both agents. Then a natural aim is to find a tradeoff. We investigate tradeoff solutions with worst case guarantees for the agents. The focus is on discrete problems having a matroid structure and the utility of an agent is modeled with a function which is either additive or weighted labeled. We provide polynomial-time deterministic algorithms which achieve several guarantees and we prove that some guarantees are not possible to reach.
Subjects / Keywords
Matroid; Bi-objective; Additive weight; Weighted labeled; Approximate solution