Paper Info
Title
Branch and Bound for negotiations in large agreement spaces
Abstract
We introduce a new multiagent negotiation algorithm for large and complex domains, called NB3. It applies Branch & Bound to search for good offers to propose. To analyze its performance we present a new problem called the Negotiating Salesmen Problem. We have conducted some experiments with NB3 from which we conclude that it manages to decrease the traveling cost of the agents significantly, that it outperforms random search and that it scales well with the complexity of the problem.
Year
DOI
Venue
2012
10.5555/2343896.2344035
AAMAS
Keywords
Field
DocType
large agreement space,new multiagent negotiation algorithm,new problem,random search,good offer,complex domain,Negotiating Salesmen Problem
Random search,Branch and bound,Computer science,Artificial intelligence,Negotiation
Conference
ISBN
Citations 
PageRank 
0-9817381-3-3
3
0.46
References 
Authors
7
2
Name
Order
Citations
PageRank
Dave de Jonge1268.04
Carles Sierra25101454.99