A Study of Optimization Method Considering Bottlenecks in Asymmetric Constraint Optimization Problem

Abstract

The representation of Constraint Optimization Problems for multiagent systems has been addressed in several studies including Distributed Constraint Optimization. We focus on the asymmetric problem where each objective function is defined as an evaluation of an individual agent. While this class of problems is studied as a multi-objective problem, there are opportunities to investigate various types of solution methods. In this study we investigate the possibility of the framework based on the Lagrangian dual methods. We address a bottleneck problem that minimizes the worst case cost. As the initial study, we experimentally apply and evaluate a formalization of the problem.