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. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-13191-7_34 | PRIMA 2014: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS |
Keywords | Field | DocType |
leximin, preference, multiple objectives, Distributed Constraint Optimization, multiagent, cooperation | Mathematical optimization,Distributed constraint optimization problem,Computer science,Pareto optimal,Distributed constraint optimization,Optimization problem | Conference |
Volume | ISSN | Citations |
8861 | 0302-9743 | 1 |
PageRank | References | Authors |
0.34 | 14 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Toshihiro Matsui | 1 | 380 | 62.51 |
Marius C. Silaghi | 2 | 375 | 47.09 |
Katsutoshi Hirayama | 3 | 472 | 44.79 |
Makoto Yokoo | 4 | 3632 | 421.99 |
Hiroshi Matsuo | 5 | 47 | 10.97 |