DocumentCode :
2009560
Title :
DisCSPs: tools for generic and efficient multi-agents negotiations
Author :
Hamadi, Youssef
Author_Institution :
Hewlett-Packards Labs, Bristol, UK
fYear :
2002
fDate :
2002
Firstpage :
245
Lastpage :
248
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
Keywords :
constraint theory; electronic commerce; multi-agent systems; open systems; software agents; DisCSP; WWW architectures; agents technology; coordination rules; distributed constraint satisfaction; efficient multi-agents negotiations; generic negotiations; inter e-business processes; inter-operability; shared search space; Character generation; Conferences; Constraint theory; Delay; Distributed processing; Information systems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Issues of E-Commerce and Web-Based Information Systems, 2002. (WECWIS 2002). Proceedings. Fourth IEEE International Workshop on
Conference_Location :
Newport Beach, CA
Print_ISBN :
0-7695-1567-3
Type :
conf
DOI :
10.1109/WECWIS.2002.1021266
Filename :
1021266
Link To Document :
بازگشت