Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities

Yanchen Deng, Bo An
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Incomplete GDL-based algorithms including Max-sum and its variants are important methods for multi-agent optimization. However, they face a significant scalability challenge as the computational overhead grows exponentially with respect to the arity of each utility function. Generic Domain Pruning (GDP) technique reduces the computational effort by performing a one-shot pruning to filter out suboptimal entries. Unfortunately, GDP could perform poorly when dealing with dense local utilities and
more » ... ies which widely exist in many domains. In this paper, we present several novel sorting-based acceleration algorithms by alleviating the effect of densely distributed local utilities. Specifically, instead of one-shot pruning in GDP, we propose to integrate both search and pruning to iteratively reduce the search space. Besides, we cope with the utility ties by organizing the search space of tied utilities into AND/OR trees to enable branch-and-bound. Finally, we propose a discretization mechanism to offer a tradeoff between the reconstruction overhead and the pruning efficiency. We demonstrate the superiorities of our algorithms over the state-of-the-art from both theoretical and experimental perspectives.
doi:10.24963/ijcai.2020/5 dblp:conf/ijcai/DengA20 fatcat:eqmrd4v4tzabxn4ge6yll7gia4