DisCSPs: tools for generic and efficient multi-agents negotiations

Abstract

The wider connectivity of WWW architectures is opening new rooms for agents technology. This results in increasing inter-operability, optimization and negotiation in inter e-business processes. We give here a short review of some efficient algorithms used in the framework of distributed constraint satisfaction (DisCSP). This formalism allows generic negotiations in multi-agents systems. We present two DisCSPs algorithms. The first one defines coordination rules between agents. The second one uses these rules to perform a systematic exploration of a shared search space.