Approximate tradeoffs on weighted labeled matroids - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2015

Approximate tradeoffs on weighted labeled matroids

Résumé

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.

Dates et versions

hal-01508729 , version 1 (25-04-2017)

Identifiants

Citer

Laurent Gourvès, Jérôme Monnot, Lydia Tlilane. Approximate tradeoffs on weighted labeled matroids. Discrete Applied Mathematics, 2015, 184, pp.154-166. ⟨10.1016/j.dam.2014.11.005⟩. ⟨hal-01508729⟩
45 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More