Name
Abstract | ||
|---|---|---|
The Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental optimization problem that represents various problems on multiagent systems. We focus on the asymmetric DCOPs where each objective function is differently defined as an evaluation of an agent. This class of problems is studied as a multi-objective problem for the preferences of individual agents. In this work, we investigate the possibility of a solution framework based on relaxation methods as a scalable and inexact solution approach for this class of problems. We address a bottleneck problem that minimizes the worst-case cost value. As the first study, we apply a penalty method to the minimization problems of the maximum cost values. |
Year | Venue | Field |
|---|---|---|
2018 | PRIMA | Bottleneck,Computer science,Relaxation (iterative method),Multi-agent system,Minification,Distributed constraint optimization,Optimization problem,Penalty method,Distributed computing,Scalability |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshihiro Matsui | 1 | 380 | 62.51 |
| Hiroshi Matsuo | 2 | 47 | 10.97 |