In this paper I introduce a new multiagent negotiation algorithm that explores the space of joint plans of action: $NB^3$. Each negotiator generates a search tree by considering both actions performed by itself and actions performed by others. The algorithm prunes the nodes of the tree that require rejected actions of others, and focusses on the most promising nodes by using appropriate heuristics.
Links:
[1] http://www.iiia.csic.es/en/individual/carles-sierra
[2] http://www.iiia.csic.es/en/publications/export/tagged/4246
[3] http://www.iiia.csic.es/en/publications/export/xml/4246
[4] http://www.iiia.csic.es/en/publications/export/bib/4246
[5] http://www.iiia.csic.es/en/project/at