Leximin asymmetric multiple objective DCOP on factor graph

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

doi:10.1007/978-3-319-25524-8_9

Leximin asymmetric multiple objective DCOP on factor graph

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

Intelligence Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

Abstract

Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed Constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. 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 inexact algorithms.

Original language	English
Title of host publication	PRIMA 2015
Subtitle of host publication	Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings
Editors	Paolo Torroni, Andrea Omicini, Jane Hsu, Qingliang Chen, Paolo Torroni, Andrea Omicini, Jane Hsu, Qingliang Chen, Serena Villata, Serena Villata
Publisher	Springer Verlag
Pages	134-151
Number of pages	18
ISBN (Print)	9783319255231, 9783319255231
DOIs	https://doi.org/10.1007/978-3-319-25524-8_9
Publication status	Published - 2015
Event	18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015 - Bertinoro, Italy Duration: Oct 26 2015 → Oct 30 2015

Publication series

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

Other

Other	18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015
Country/Territory	Italy
City	Bertinoro
Period	10/26/15 → 10/30/15

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-25524-8_9

Cite this

Matsui, T., Silaghi, M., Okimoto, T., Hirayama, K., Yokoo, M., & Matsuo, H. (2015). Leximin asymmetric multiple objective DCOP on factor graph. In P. Torroni, A. Omicini, J. Hsu, Q. Chen, P. Torroni, A. Omicini, J. Hsu, Q. Chen, S. Villata, & S. Villata (Eds.), PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings (pp. 134-151). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9387). Springer Verlag. https://doi.org/10.1007/978-3-319-25524-8_9

Leximin asymmetric multiple objective DCOP on factor graph. / Matsui, Toshihiro; Silaghi, Marius; Okimoto, Tenda et al.
PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings. ed. / Paolo Torroni; Andrea Omicini; Jane Hsu; Qingliang Chen; Paolo Torroni; Andrea Omicini; Jane Hsu; Qingliang Chen; Serena Villata; Serena Villata. Springer Verlag, 2015. p. 134-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9387).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Matsui, T, Silaghi, M, Okimoto, T, Hirayama, K, Yokoo, M & Matsuo, H 2015, Leximin asymmetric multiple objective DCOP on factor graph. in P Torroni, A Omicini, J Hsu, Q Chen, P Torroni, A Omicini, J Hsu, Q Chen, S Villata & S Villata (eds), PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9387, Springer Verlag, pp. 134-151, 18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015, Bertinoro, Italy, 10/26/15. https://doi.org/10.1007/978-3-319-25524-8_9

Matsui T, Silaghi M, Okimoto T, Hirayama K, Yokoo M, Matsuo H. Leximin asymmetric multiple objective DCOP on factor graph. In Torroni P, Omicini A, Hsu J, Chen Q, Torroni P, Omicini A, Hsu J, Chen Q, Villata S, Villata S, editors, PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings. Springer Verlag. 2015. p. 134-151. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-25524-8_9

Matsui, Toshihiro ; Silaghi, Marius ; Okimoto, Tenda et al. / Leximin asymmetric multiple objective DCOP on factor graph. PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Proceedings. editor / Paolo Torroni ; Andrea Omicini ; Jane Hsu ; Qingliang Chen ; Paolo Torroni ; Andrea Omicini ; Jane Hsu ; Qingliang Chen ; Serena Villata ; Serena Villata. Springer Verlag, 2015. pp. 134-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9d22fd571e9c44e89babf26a090d635e,

title = "Leximin asymmetric multiple objective DCOP on factor graph",

abstract = "Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed Constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. 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 inexact algorithms.",

author = "Toshihiro Matsui and Marius Silaghi and Tenda Okimoto and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015 ; Conference date: 26-10-2015 Through 30-10-2015",

year = "2015",

doi = "10.1007/978-3-319-25524-8_9",

language = "English",

isbn = "9783319255231",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "134--151",

editor = "Paolo Torroni and Andrea Omicini and Jane Hsu and Qingliang Chen and Paolo Torroni and Andrea Omicini and Jane Hsu and Qingliang Chen and Serena Villata and Serena Villata",

booktitle = "PRIMA 2015",

address = "Germany",

}

TY - GEN

T1 - Leximin asymmetric multiple objective DCOP on factor graph

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Okimoto, Tenda

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed Constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. 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 inexact algorithms.

AB - Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed Constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. 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 inexact algorithms.

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

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

U2 - 10.1007/978-3-319-25524-8_9

DO - 10.1007/978-3-319-25524-8_9

M3 - Conference contribution

AN - SCOPUS:84950326541

SN - 9783319255231

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

SP - 134

EP - 151

BT - PRIMA 2015

A2 - Torroni, Paolo

A2 - Omicini, Andrea

A2 - Hsu, Jane

A2 - Chen, Qingliang

A2 - Torroni, Paolo

A2 - Omicini, Andrea

A2 - Hsu, Jane

A2 - Chen, Qingliang

A2 - Villata, Serena

PB - Springer Verlag

T2 - 18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015

Y2 - 26 October 2015 through 30 October 2015

ER -

Leximin asymmetric multiple objective DCOP on factor graph

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this