3 Dave de Jonge Carles Sierra 2012 Conitzer, Winikoff, Padgham, and van der Hoek AAMAS '12: Proceedings of the 11th internationalconference on autonomous agents and multiagent systems Valencia, Spain International Foundation for Autonomous Agents and Multiagent Systems Richland, SC ©2012 3 1415-1416 04/06/2012 0-9817381-3-3 978-0-9817 Negotiation, Search, Branch and Bound, Negotiating Salesmen Problem 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.