Risk-neutral bounded max-sum for distributed constraint optimization

  • Authors:
  • Javier Larrosa;Emma Rollon

  • Affiliations:
  • Universitat Politècnica de Catalunya, Spain;Universitat Politècnica de Catalunya, Spain

  • Venue:
  • Proceedings of the 28th Annual ACM Symposium on Applied Computing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Bounded Max-Sum is a message-passing algorithm for solving Distributed Constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirically proved to be within a small percentage of the optimal solution on low and moderate dense problems, in this paper we show that a simple modification systematically provides even better solutions. This is especially relevant in critical applications (e.g. disaster response scenarios) where the accuracy of solutions is of vital importance.