Governing convergence of Max-sum on DCOPs through damping and splitting

DOI10.1016/J.ARTINT.2019.103212zbMATH Open1478.68319OpenAlexW2992865406MaRDI QIDQ2287205FDOQ2287205

Authors: Liel Cohen, Rotem Galiki, Roie Zivan 

Publication date: 20 January 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2019.103212

Recommendations

• Solving highly cyclic distributed optimization problems without busting the bank: a decimation-based approach
• Asymmetric distributed constraint optimization problems
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Privacy preserving implementation of the \textsc{Max-Sum} algorithm and its variants
• A class of algorithms for distributed constraint optimization.

zbMATH Keywords

distributed constraint optimizationMax-sumincomplete inference algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Linear programming relaxations and belief propagation -- an empirical study
• Explorative anytime local search for distributed constraint optimization
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Approximations in Distributed Optimization
• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• The generalized distributive law
• Title not available (Why is that?)
• Bounded approximate decentralised coordination via the max-sum algorithm
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• Message-Passing Algorithms: Reparameterizations and Splittings

Cited In (6)

• Proactive Dynamic Distributed Constraint Optimization Problems
• Improved max-sum decentralized coordination algorithm
• Privacy preserving solution of DCOPs by mediation
• Separate but equal: equality in belief propagation for single-cycle graphs
• A hybrid continuous max-sum algorithm for decentralised coordination
• Solving highly cyclic distributed optimization problems without busting the bank: a decimation-based approach

This page was built for publication: Governing convergence of Max-sum on DCOPs through damping and splitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287205)