@conference {4562, title = {Branch and Bound for Negotiations in Large Agreement Spaces}, booktitle = {AAMAS {\textquoteright}12: Proceedings of the 11th internationalconference on autonomous agents and multiagent systems}, volume = {3}, year = {2012}, month = {04/06/2012}, pages = {1415-1416}, publisher = {International Foundation for Autonomous Agents and Multiagent Systems Richland, SC {\textcopyright}2012}, organization = {International Foundation for Autonomous Agents and Multiagent Systems Richland, SC {\textcopyright}2012}, address = {Valencia, Spain}, abstract = {We introduce a new multiagent negotiation algorithm for large and complex domains, called NB3. It applies Branch \& Bound to search for good off ers 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.}, keywords = {Branch and Bound, Negotiating Salesmen Problem, Negotiation, Search}, isbn = {0-9817381-3-3 978-0-9817}, author = {Dave de Jonge and Carles Sierra}, editor = {Conitzer and Winikoff and Padgham and van der Hoek} }