Branch and Bound for negotiations in large agreement spaces

Authors:
Dave de Jonge;Carles Sierra
Affiliations:
Artificial Intelligence Research Institute, IIIA-CSIC, Campus de la UAB, Bellaterra, Catalonia, Spain;Artificial Intelligence Research Institute, IIIA-CSIC, Campus de la UAB, Bellaterra, Catalonia, Spain
Venue:
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2012

Citing 3
Cited 0

Protocols for Negotiating Complex Contracts

IEEE Intelligent Systems
Effective bidding and deal identification for negotiations in highly nonlinear scenarios

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
An Agent Architecture for Simultaneous Bilateral Negotiations

Proceedings of the 2010 conference on Artificial Intelligence Research and Development: Proceedings of the 13th International Conference of the Catalan Association for Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.