Local search for distributed asymmetric optimization

Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. DCOP algorithms search for the optimal solution, optimizing the total gain (or cost) that is composed of all gains of all agents. Local search (LS) DCOP algorithms search locally for an approximate such solution. 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 standard DCOP model. The present paper proposes a general framework for Asymmetric DCOPs (ADCOPs). The new framework is described and its differences from former attempts are discussed. New local search algorithms for ADCOPs are introduced and their advantages over existing algorithms and over former representations are discussed in detail. The new proposed algorithms for the ADCOP framework are evaluated experimentally and their performance compared to existing algorithms. Two measures of performance are used: quality of solutions and loss of privacy. The results show that the new algorithms significantly outperform existing DCOP algorithms with respect to both measures.

[1]  Amnon Meisels,et al.  Asynchronous Forward Bounding for Distributed COPs , 2014, J. Artif. Intell. Res..

[2]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[3]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[4]  Adrian Petcu,et al.  A Class of Algorithms for Distributed Constraint Optimization , 2009, Frontiers in Artificial Intelligence and Applications.

[5]  Archie C. Chapman,et al.  A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games , 2008 .

[6]  Milind Tambe,et al.  Distributed Algorithms for DCOP: A Graphical-Game-Based Approach , 2004, PDCS.

[7]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[8]  Milind Tambe,et al.  Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems , 2007, IJCAI.

[9]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[10]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[11]  L. Shapley,et al.  Potential Games , 1994 .

[12]  Nicholas R. Jennings,et al.  Decentralised coordination of continuously valued control parameters using the max-sum algorithm , 2009, AAMAS.

[13]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[14]  Makoto Yokoo,et al.  Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information , 2002, CP.

[15]  Rachel Greenstadt.  An analysis of privacy loss in k-optimal algorithms , 2008 .

[16]  Roie Zivan.  Anytime Local Search for Distributed Constraint Optimization , 2008, AAAI.

[17]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[18]  Amnon Meisels.  Asynchronous Forward-Bounding , 2008 .

[19]  Milind Tambe,et al.  Analysis of Privacy Loss in Distributed Constraint Optimization , 2006, AAAI.

[20]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[21]  Amnon Meisels,et al.  Distributed Search by Constrained Agents: Algorithms, Performance, Communication , 2007, Advanced Information and Knowledge Processing.

[22]  Milind Tambe,et al.  Valuations of Possible States (VPS): a quantitative framework for analysis of privacy loss among collaborative personal assistant agents , 2005, AAMAS '05.

[23]  Milind Tambe,et al.  Using DCOPs to Balance Exploration and Exploitation in Time-Critical Domains , 2009 .

[24]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[25]  Milind Tambe,et al.  A Family of Graphical-Game-Based Algorithms for Distributed Constraint Optimization Problems , 2006 .