Leximin multiple objective optimization for preferences of agents

Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We address a variation of Multiple Objective Distributed Constraint Optimization Problems (MODCOPs). In the conventional MODCOPs, a few objectives are globally defined and agents cooperate to find the Pareto optimal solution. On the other hand, in several practical problems, the share of each agent is important. Such shares are represented as preference values of agents. This class of problems is defined as theMODCOP on the preferences of agents. Particularly, we focus on the optimization problems based on the leximin ordering (Leximin AMODCOPs), which improves the equality among agents. The solution methods based on pseudo trees are applied to the Leximin AMODCOPs.

Original languageEnglish
Title of host publicationPRIMA 2014
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 17th International Conference, Proceedings
PublisherSpringer Verlag
Pages423-438
Number of pages16
ISBN (Electronic)9783319131900
Publication statusPublished - Jan 1 2014
Event17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014 - Gold Coast, Australia
Duration: Dec 1 2014Dec 5 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8861
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014
CountryAustralia
CityGold Coast
Period12/1/1412/5/14

Fingerprint

Multiple Objective Optimization
Multiple Objectives
Optimization Problem
Pareto Optimal Solution
Equality

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., & Matsuo, H. (2014). Leximin multiple objective optimization for preferences of agents. In PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings (pp. 423-438). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8861). Springer Verlag.

Leximin multiple objective optimization for preferences of agents. / Matsui, Toshihiro; Silaghi, Marius; Hirayama, Katsutoshi; Yokoo, Makoto; Matsuo, Hiroshi.

PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Springer Verlag, 2014. p. 423-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8861).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsui, T, Silaghi, M, Hirayama, K, Yokoo, M & Matsuo, H 2014, Leximin multiple objective optimization for preferences of agents. in PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8861, Springer Verlag, pp. 423-438, 17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014, Gold Coast, Australia, 12/1/14.
Matsui T, Silaghi M, Hirayama K, Yokoo M, Matsuo H. Leximin multiple objective optimization for preferences of agents. In PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Springer Verlag. 2014. p. 423-438. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Matsui, Toshihiro ; Silaghi, Marius ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Matsuo, Hiroshi. / Leximin multiple objective optimization for preferences of agents. PRIMA 2014: Principles and Practice of Multi-Agent Systems - 17th International Conference, Proceedings. Springer Verlag, 2014. pp. 423-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cca811d23629431c88ced8d19c7454fa,
title = "Leximin multiple objective optimization for preferences of agents",
abstract = "We address a variation of Multiple Objective Distributed Constraint Optimization Problems (MODCOPs). In the conventional MODCOPs, a few objectives are globally defined and agents cooperate to find the Pareto optimal solution. On the other hand, in several practical problems, the share of each agent is important. Such shares are represented as preference values of agents. This class of problems is defined as theMODCOP on the preferences of agents. Particularly, we focus on the optimization problems based on the leximin ordering (Leximin AMODCOPs), which improves the equality among agents. The solution methods based on pseudo trees are applied to the Leximin AMODCOPs.",
author = "Toshihiro Matsui and Marius Silaghi and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",
year = "2014",
month = "1",
day = "1",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "423--438",
booktitle = "PRIMA 2014",
address = "Germany",

}

TY - GEN

T1 - Leximin multiple objective optimization for preferences of agents

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We address a variation of Multiple Objective Distributed Constraint Optimization Problems (MODCOPs). In the conventional MODCOPs, a few objectives are globally defined and agents cooperate to find the Pareto optimal solution. On the other hand, in several practical problems, the share of each agent is important. Such shares are represented as preference values of agents. This class of problems is defined as theMODCOP on the preferences of agents. Particularly, we focus on the optimization problems based on the leximin ordering (Leximin AMODCOPs), which improves the equality among agents. The solution methods based on pseudo trees are applied to the Leximin AMODCOPs.

AB - We address a variation of Multiple Objective Distributed Constraint Optimization Problems (MODCOPs). In the conventional MODCOPs, a few objectives are globally defined and agents cooperate to find the Pareto optimal solution. On the other hand, in several practical problems, the share of each agent is important. Such shares are represented as preference values of agents. This class of problems is defined as theMODCOP on the preferences of agents. Particularly, we focus on the optimization problems based on the leximin ordering (Leximin AMODCOPs), which improves the equality among agents. The solution methods based on pseudo trees are applied to the Leximin AMODCOPs.

UR - http://www.scopus.com/inward/record.url?scp=84910146244&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910146244&partnerID=8YFLogxK

M3 - Conference contribution

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 423

EP - 438

BT - PRIMA 2014

PB - Springer Verlag

ER -