Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs

Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each agent can in principle select an optimal individual action based on a variable elimination algorithm performed on this graph. This results in optimal behavior for the group, but its worst-case time complexity is exponential in the number of agents, and it can be slow in densely connected graphs. Moreover, variable elimination is not appropriate for real-time systems as it requires that the complete algorithm terminates before a solution can be reported. In this paper, we investigate the max-plus algorithm, an instance of the belief propagation algorithm in Bayesian networks, as an approximate alternative to variable elimination. In this method the agents exchange appropriate payoff messages over the coordination graph, and based on these messages compute their individual actions. We provide empirical evidence t...

• Type: Conference
• Year: 2005
• Where: ROBOCUP
• Authors: Jelle R. Kok, Nikos A. Vlassis
• Keywords: Coordination Graph, ROBOCUP 2005, Variable Elimination, Variable Elimination Algorithm