Asymmetric Distributed Constraint Optimization Problems
نویسندگان
چکیده
منابع مشابه
Asymmetric Distributed Constraint Optimization Problems
Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. Many multi-agent problems include constraints that produce different gains (or costs) for the participating agents. Asymmetric gains of constrained agents cannot be naturally represented by the stand...
متن کاملAsymmetric Distributed Constraint Optimization
The standard model of distributed constraints optimization problems (DCOPs), assumes that the cost of a constraint is checked by one of the agents involved in the constraint. For DCOPs this is equivalent to the assumption that each constraint has a global cost which applies to each of the participating agents and in other words that all constraints are symmetric. Many multi agent system (MAS) p...
متن کاملResilient Distributed Constraint Optimization Problems
Dynamic distributed constraint optimization problems (Dynamic DCOPs) are useful in modeling various distributed combinatorial optimization problems that are dynamically changing over time. Previous attempts assume that it is possible for agents to take on a new solution each time the problem changes. However, in some applications, it is necessary to commit to a single solution at the start of t...
متن کاملSolving Distributed Constraint Optimization Problems Using Ranks
We present a variation of the classical Distributed Stochastic Algorithm (DSA), a local iterative best-response algorithm for Distributed Constraint Optimization Problems (DCOPs). We introduce weights for the agents, which influence their behaviour. We model DCOPs as graph processing problems, where the variables are represented as vertices and the constraints as edges. This enables us to creat...
متن کاملApplying Max-Sum to Asymmetric Distributed Constraint Optimization
We study the adjustment and use of the Max-sum algorithm for solving Asymmetric Distributed Constraint Optimization Problems (ADCOPs). First, we formalize asymmetric factor-graphs and apply the different versions of Max-sum to them. Apparently, in contrast to local search algorithms, most Max-sum versions perform similarly when solving symmetric and asymmetric problems and some even perform bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2013
ISSN: 1076-9757
DOI: 10.1613/jair.3945