Abstract
In constraint satisfaction problems (CSP) we consider N variables x 1,x 2, ...x N , their definition domains D 1,D 2, ...,D N and a set of constraints on the values of these variables; solving the CSP means finding a particular value for the variables that satisfies the constraints. In the distributed CSP (DCSP) as defined by Makoto Yokoo [1], the variables of the CSP are distributed among the agents. These agents are able to communicate between themselves and know all the constraint predicates relevant to their variable. The agents through interaction find the appropriate values to solve the CSP.
The naming game describes a set of problems in which a number N of agents bootstrap a commonly agreed name for an object. Each naming game is defined by an interaction protocol/algorithm. An important aspect of the naming game is the hierarchy-free agent architecture. For other references on the naming game see the work of Steels [3] and Baronchelli et al. [2].
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
References
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In: 12th International Conference on Distributed Computing Systems (ICDCS 1992), pp. 614–621 (1992)
Baronchelli, A., Felici, M., Caglioti, E., Loreto, V., Steels, L.: Sharp transition Toward Shared Vocabularies in Multi-Agent Systems. Journal of Statistical Mechanics, P06014 (2006)
Steels, L.: Self-Organizing Vocabularies. In: Langton, C., Shimohara, K. (eds.) Artificial Life V: Proceeding of the Fifth International Workshop on the Synthesis and Simulation of Living Systems, pp. 179–184 (1997)
Nowak, M.A., Plotkin, J.B., Krakauer, J.D.: The evolutionary language game. Journal of Theoretical Biology 200, 147 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gosti, G. (2008). Resolving CSP with Naming Games. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-89982-2_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89981-5
Online ISBN: 978-3-540-89982-2
eBook Packages: Computer ScienceComputer Science (R0)