• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Multiagent Fair Optimization with Lorenz Dominance

Thumbnail
View/Open
AAMAS_Lorenz.pdf (422.2Kb)
Date
2015
Dewey
Recherche opérationnelle
Sujet
Multiobjective combinatorial optimization; Fairness; Lorenz dominance; Two-phase method
Conference name
International Conference on Autonomous Agents and Multiagent Systems (AAMAS 15)
Conference date
05-2015
Conference city
Istanbul
Conference country
Turkey
Book title
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems (AAMAS 15)
Author
Bordini, Elkind; Weiss, Yolum
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Publisher city
Richland
Year
2015
ISBN
978-1-4503-3413-6
URI
https://basepub.dauphine.fr/handle/123456789/15911
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Galand, Lucie
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Lust, Thibaut
233 Laboratoire d'Informatique de Paris 6 [LIP6]
Type
Communication / Conférence
Item number of pages
1895-1896
Abstract (EN)
This paper deals with fair optimization problems where several agents are involved. In this setting, a solution is evaluated by a vector whose components are the utility of the agents for this solution, and one looks for solutions that fairly satisfy all the agents. Lorenz dominance has been proposed in economics to refine the Pareto dominance by taking into account satisfaction inequality among the agents. The computation of Lorenz efficient solutions in multiagent optimization is however challenging (it has been shown intractable and NP-hard on certain problems). Nevertheless, to our knowledge, very few works address this problem. We propose thus in this work new methods to generate Lorenz efficient solutions. More precisely, we consider the adaptation of the well-known two-phase method proposed in biobjective optimization to the bi-agent optimization case, where one wants to directly compute the Lorenz efficient solutions. We study the efficiency of our method by applying it on the bi-agent knapsack problem.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.