|Títol||Negotiation Based Branch and Bound and the Negotiating Salesmen Problem|
|Publication Type||Conference Paper|
|Year of Publication||2011|
|Authors||de Jonge D, Sierra C|
|Conference Name||Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence (CCIA 2011)|
|Conference Location||Lleida, Catalonia, Spain|
We introduce a new multiagent negotiation algorithm that explores the space of joint plans of action: NB3. Each negotiator generates a search tree by considering both actions performed by itself and actions performed by others. In order to test the algorithm we present a new variant of the Traveling Salesman Problem, in which there is not one, but many salesmen. The salesmen need to negotiate with each other in order to minimize the distances they have to cover. Finally we present the results of some tests we did with a simple implementation of the algorithm for this problem.
- Quant a IIIA