Resolving CSP with Naming Games

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].

[1]  Christopher G. Langton,et al.  Artificial life V : proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems , 1996 .

[2]  R. VictorLesser,et al.  An Overview of DAI : Viewing Distributed AI as Distributed Search , 1990 .

[3]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[4]  K. Tuyls,et al.  The evolutionary language game: an orthogonal approach. , 2005, Journal of theoretical biology.

[5]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[6]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[7]  K. Jameson,et al.  Evolutionary models of color categorization based on discrimination , 2007 .

[8]  Vittorio Loreto,et al.  Topology Induced Coarsening in Language Games , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Vittorio Loreto,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Sharp transition towardsshared vocabularies in multi-agent systems , 2006 .

[10]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[11]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM 1992.

[12]  M. Sipper.  Co-evolving non-uniform cellular automata to perform computations , 1996 .

[13]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[14]  P. Niyogi,et al.  Computational and evolutionary aspects of language , 2002, Nature.

[15]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[16]  M. Nowak,et al.  The evolutionary language game. , 1999, Journal of theoretical biology.

[17]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.