Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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  present a new problem called the Negotiating Salesmen Problem.  have conducted some experiments with NB3 from which  conclude that it manages to decrease the traveling cost of the agents significantly, that it outperforms random search and that it scales ll with the complexity of the problem.
['Dave de Jonge', 'Carles Sierra']
I am writing a research paper on a idea Branch and Bound for negotiations in large agreement spaces
[{"from": "human", "value": "I am writing a research paper on a idea Branch and Bound for negotiations in large agreement spaces"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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  present a new problem called the Negotiating Salesmen Problem.  have conducted some experiments with NB3 from which  conclude that it manages to decrease the traveling cost of the agents significantly, that it outperforms random search and that it scales ll with the complexity of the problem."}]