Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs based on its the criteria of fairness among agents. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-Ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several approximate/inexact algorithms.

Original languageEnglish
Pages (from-to)63-91
Number of pages29
JournalFundamenta Informaticae
Volume158
Issue number1-3
DOIs
Publication statusPublished - Jan 1 2018

Fingerprint

Factor Graph
Multiple Objectives
Multi agent systems
Multi-agent Systems
Optimization Problem
Unary
Fairness
Dynamic programming
Dynamic Programming
Exact Solution
Binary
Graph in graph theory
Operator

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents. / Matsui, Toshihiro; Silaghi, Marius; Okimoto, Tenda; Hirayama, Katsutoshi; Yokoo, Makoto; Matsuo, Hiroshi.

In: Fundamenta Informaticae, Vol. 158, No. 1-3, 01.01.2018, p. 63-91.

Research output: Contribution to journalArticle

Matsui, T, Silaghi, M, Okimoto, T, Hirayama, K, Yokoo, M & Matsuo, H 2018, 'Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents', Fundamenta Informaticae, vol. 158, no. 1-3, pp. 63-91. https://doi.org/10.3233/FI-2018-1642
Matsui, Toshihiro ; Silaghi, Marius ; Okimoto, Tenda ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Matsuo, Hiroshi. / Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents. In: Fundamenta Informaticae. 2018 ; Vol. 158, No. 1-3. pp. 63-91.
@article{77f37fbed7af4a82bbe408032d72d6f4,
title = "Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents",
abstract = "Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs based on its the criteria of fairness among agents. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-Ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several approximate/inexact algorithms.",
author = "Toshihiro Matsui and Marius Silaghi and Tenda Okimoto and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",
year = "2018",
month = "1",
day = "1",
doi = "10.3233/FI-2018-1642",
language = "English",
volume = "158",
pages = "63--91",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-3",

}

TY - JOUR

T1 - Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Okimoto, Tenda

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs based on its the criteria of fairness among agents. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-Ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several approximate/inexact algorithms.

AB - Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs based on its the criteria of fairness among agents. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-Ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several approximate/inexact algorithms.

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

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

U2 - 10.3233/FI-2018-1642

DO - 10.3233/FI-2018-1642

M3 - Article

AN - SCOPUS:85047927092

VL - 158

SP - 63

EP - 91

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-3

ER -