@conference {1510232,
	title = {Are multiagent algorithms relevant for real hardware? A case study of distributed constraint algorithms },
	booktitle = {ACM Symposium on applied computing (SAC{\textquoteright}2003)},
	year = {2003},
	abstract = {Researchers building multi-agent algorithms typically work with
problems abstracted away from real applications. The abstracted
problem instances allow systematic and detailed investigations of
new algorithms. However, a key question is how to apply algorithm, developed on an abstract problem, in a real application. In
this paper, we report on what was required to apply a particular
distributed resource allocation algorithm developed for an abstract
coordination problem in a real hardware application. A probabilistic representation of resources and tasks was used to deal with uncertainty and dynamics and local reasoning was used to deal with
delays in the distributed resource allocation algorithm. The probabilistic representation and local reasoning enabled the use of the
multi-agent algorithm which, in turn, improved the overall performance of the system.},
	author = {Paul Scerri and Pragnesh J. Modi and Tambe, Milind and W. Shen}
}
