Negotiation algorithms for collaborative design settings

Abstract

Work to date on computational models of negotiation has focused almost exclusively on defining 'simple' agreements consisting of one or a few independent issues [1] [2]. These protocols work via the iterative exchange of proposals and counter-proposals. An agent starts with proposal that is optimal for it and makes concessions, in each subsequent proposal, until either an agreement is reached or the negotiation is abandoned because the utility of the latest proposal has fallen below the agents' reservation (minimal acceptable utility) value (Figure 1): © 2006 Springer.