• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
10.1.1.408.4785.pdf (125.6Kb)
Type
Article accepté pour publication ou publié
Date
2015
Journal name
Discrete Applied Mathematics
Volume
184
Publisher
Elsevier
Pages
154-166
Publication identifier
10.1016/j.dam.2014.11.005
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

Related items

Showing items related by title and author.

  • Thumbnail
    Approximate Tradeoffs on Matroids 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2012) Communication / Conférence
  • Thumbnail
    Approximation du point idéal dans des matroïdes: bornes et algorithmes 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2013) Communication / Conférence
  • Thumbnail
    A matroid approach to the worst case allocation of indivisible goods 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2013) Communication / Conférence
  • Thumbnail
    A Protocol for Cutting Matroids Like Cakes 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2013) Communication / Conférence
  • Thumbnail
    Worst case compromises in matroids with applications to the allocation of indivisible goods 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2015) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo