The ordered weighted averaging operators: theory and applications
The ordered weighted averaging operators: theory and applications
Direct search methods: then and now
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
Protocols for Negotiating Complex Contracts
IEEE Intelligent Systems
A multi-issue negotiation protocol among agents with nonlinear utility functions
Multiagent and Grid Systems - Negotiation and Scheduling Mechanisms for Multiagent Systems
Searching for fair joint gains in agent-based negotiation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Improving trade-offs in automated bilateral negotiations for expressive and inexpressive scenarios
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Knowledge integration and management in autonomous systems
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Multiagent negotiation may be understood as a consensus based group decision-making which ideally should seek the agreement of all the participants. However, there exist situations where an unanimous agreement is not possible or simply the rules imposed by the system do not seek such unanimous agreement. In this paper we propose to use a consensus policy based mediation framework (CPMF) to perform multiagent negotiations. This proposal fills a gap in the literature where protocols are in most cases indirectly biased to search for a quorum. The mechanisms proposed to perform the exploration of the negotiation space are derived from the Generalized Pattern Search non-linear optimization technique (GPS). The mediation mechanisms are guided by the aggregation of the agent preferences on the set of alternatives the mediator proposes in each negotiation round. Considerable interest is focused on the implementation of the mediation rules where we allow for a linguistic description of the type of agreements needed. We show empirically that CPMF efficiently manages negotiations following predefined consensus policies and solves situations where unanimous agreements are not viable.