TitleBranch and Bound for Negotiations in Large Agreement Spaces
Publication TypeConference Paper
Year of Publication2012
Authorsde Jonge D, Sierra C
Editor, der Hoek van
Conference NameAAMAS '12: Proceedings of the 11th internationalconference on autonomous agents and multiagent systems
Volume3
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems Richland, SC ©2012
Conference LocationValencia, Spain
Pagination1415-1416
Date Published04/06/2012
ISBN Number0-9817381-3-3 978-0-9817
KeywordsBranch and Bound, Negotiating Salesmen Problem, Negotiation, Search
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.