Anytime Coordination Using Separable Bilinear Programs

Marek Petrik and Shlomo Zilberstein. Anytime Coordination Using Separable Bilinear Programs. Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI), 750-755, Vancouver, British Columbia, 2007.

Abstract

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm and derive both online and offline error bounds for approximate solutions. Moreover, we propose an effective way to automatically reduce the complexity of the interaction. Our experiments show that this is a promising approach to solve a broad class of decentralized decision problems. The general formulation used by the algorithm makes it both easy to implement and widely applicable to a variety of other AI problems.

Bibtex entry:

@inproceedings{PZaaai07,
  author	= {Marek Petrik and Shlomo Zilberstein},
  title		= {Anytime Coordination Using Separable Bilinear Programs},
  booktitle     = {Proceedings of the Twenty-Second Conference on
		   Artificial Intelligence},
  year		= {2007},
  pages		= {750-755},
  address       = {Vancouver, British Columbia},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/PZaaai07.html}
}

shlomo@cs.umass.edu