AN APPROACH TO SCALABLE MULTI-ISSUE NEGOTIATION: DECOMPOSING THE CONTRACT SPACE
Article first published online: 4 SEP 2012
© 2012 Wiley Periodicals, Inc.
Special Issue: Automated Negotiation Techniques in Multiagent Systems Guest Editors: Takayuki Ito, Minjie Zhang and Tokuro Matsuo
Volume 30, Issue 1, pages 30–47, February 2014
How to Cite
Fujita, K., Ito, T. and Klein, M. (2014), AN APPROACH TO SCALABLE MULTI-ISSUE NEGOTIATION: DECOMPOSING THE CONTRACT SPACE. Computational Intelligence, 30: 30–47. doi: 10.1111/j.1467-8640.2012.00462.x
- Issue published online: 4 FEB 2014
- Article first published online: 4 SEP 2012
- Received 22 December 2010; Revised 25 May 2011; Accepted 21 August 2011; Published online 4 September 2012
- bargaining and negotiation;
- interdependent issues;
- multi-issue negotiation
Most real-world negotiation involves multiple interdependent issues, which makes an agent’s utility functions nonlinear. Traditional negotiation mechanisms, which were designed for linear utilities, do not fare well in nonlinear contexts. One of the main challenges in developing effective nonlinear negotiation protocols is scalability; they cannot find a high-quality solution when there are many issues, due to computational intractability. One reasonable approach to reducing computational cost, while maintaining good quality outcomes, is to decompose the utility space into several largely independent subspaces. In this paper, we propose a method for decomposing a utility space based on every agent’s utility space. In addition, the mediator finds the contracts in each group based on the votes from all agents, and combines the contract in each issue-group. This method allows good outcomes with greater scalability than the method without issue-grouping. We demonstrate that our protocol, based on issue-groups, has a higher optimality rate than previous efforts, and discuss the impact on the optimality of the negotiation outcomes.