Solving CSPs with Naming Games

Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the naming games. The naming game was introduced to represent N agents that have to bootstrap an agreement on a name to give to an object. The agents do not have a hierarchy and use a minimal protocol. Still they converge to a consistent state by using a distributed strategy. For this reason the naming game can be used to untangle distributed constraint solving problems (DCSPs). Moreover it represents a good starting point for a systematic study of DCSP methods, which can be seen as further improvement of this approach.

• Type: Conference
• Year: 2008
• Where: CSCLP
• Authors: Stefano Bistarelli, Giorgio Gosti
• Keywords: Artificial Intelligence, Constraint Solving Problems, CSCLP 2008, Important Class, Naming Game