Paper Info
Title
Negotiation Based Branch & Bound and the Negotiating Salesmen Problem
Abstract
We introduce a new multiagent negotiation algorithm that explores the space of joint plans of action: N B-3. 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.
Year
DOI
Venue
2011
10.3233/978-1-60750-842-7-91
Frontiers in Artificial Intelligence and Applications
Keywords
DocType
Volume
Negotiation,Search,Negotiating Salesmen Problem
Conference
232
ISSN
Citations 
PageRank 
0922-6389
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Dave de Jonge1268.04
Carles Sierra25101454.99