Abstract
One limitation of the algorithms described so far is that they assume each agent has only one local variable. This assumption cannot be satisfied when the local problem of each agent becomes large and complex. Although these algorithms can be applied to the situation where one agent has multiple local variables by the following methods, both methods are neither efficient nor scalable to large problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yokoo, M. (2001). Handling Multiple Local Variables. In: Distributed Constraint Satisfaction. Springer Series on Agent Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59546-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-59546-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64020-9
Online ISBN: 978-3-642-59546-2
eBook Packages: Springer Book Archive