Reward-based region optimal quality guarantees

Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi-agent networks. DCOP is NP-hard [6], so an important line of work focuses on developing fast incomplete solution algorithms that can provide guarantees on the quality of their local optimal solutions. Region optimality [11] is a promising approach along this line: it provides quality guarantees for region optimal solutions, namely solutions that are optimal in a specific region of the DCOP. Region optimality generalises kand t-optimality [7, 4] by allowing to explore the space of criteria that define regions to look for solutions with better quality guarantees. Unfortunately, previous work in region-optimal quality guarantees fail to exploit any a-priori knowledge of the reward structure of the problem. This paper addresses this shortcoming by defining reward-dependent region optimal quality guarantees that exploit two different levels of knowledge about rewards, namely: (i) a ratio between the least minimum reward to the maximum reward among relations; and (ii) the minimum and maximum rewards per relation.

[1]  Nicholas R. Jennings,et al.  Decentralised coordination of low-power embedded devices using the max-sum algorithm , 2008, AAMAS.

[2]  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..

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

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

[5]  Milind Tambe,et al.  LP formulation for regional-optimal bounds , 2011 .

[6]  Manish Jain,et al.  On k-optimal distributed constraint optimization algorithms: new bounds and algorithms , 2008, AAMAS.

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

[8]  Meritxell Vinyals,et al.  Divide and Coordinate: solving DCOPs by agreement , 2010, AAMAS 2010.

[9]  Ana L. C. Bazzan,et al.  Evaluating the performance of DCOP algorithms in a real world, dynamic problem , 2008, AAMAS.

[10]  Milind Tambe,et al.  Asynchronous algorithms for approximate distributed constraint optimization with quality bounds , 2010, AAMAS.

[11]  Milind Tambe,et al.  Quality guarantees for region optimal DCOP algorithms , 2011, AAMAS.

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