Reaching unanimous agreements within agent-based negotiation teams with linear and monotonic utility functions

[EN] In this article, an agent-based negotiation model for negotiation teams that negotiate a deal with an opponent is presented. Agent-based negotiation teams are groups of agents that join together as a single negotiation party because they share an interest that is related to the negotiation process. The model relies on a trusted mediator that coordinates and helps team members in the decisions that they have to take during the negotiation process: which offer is sent to the opponent, and whether the offers received from the opponent are accepted. The main strength of the proposed negotiation model is the fact that it guarantees unanimity within team decisions since decisions report a utility to team members that is greater than or equal to their aspiration levels at each negotiation round. This work analyzes how unanimous decisions are taken within the team and the robustness of the model against different types of manipulations. An empirical evaluation is also performed to study the impact of the different parameters of the model.This work is supported by TIN2008-04446, PROMETEO/2008/051, TIN2009-13839-C03-01, CSD2007-00022 of the Spanish government, and FPU Grant AP2008-00600 awarded to Victor Sanchez-Anguix. This paper was recommended by Associate Editor X. Wang.Sanchez-Anguix, V.; Julian Inglada, VJ.; Botti, V.; García-Fornes, A. (2012). Reaching unanimous agreements within agent-based negotiation teams with linear and monotonic utility functions. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics. 42(3):778-792. https://doi.org/10.1109/TSMCB.2011.2177658S77879242

A stability constrained adaptive alpha for gravitational search algorithm

Gravitational search algorithm (GSA), a recent meta-heuristic algorithm inspired by Newton’s law of gravity and mass interactions, shows good performance in various optimization problems. In GSA, the gravitational constant attenuation factor alpha ( α ) plays a vital role in convergence and the balance between exploration and exploitation. However, in GSA and most of its variants, all agents share the same α value without considering their evolutionary states, which has inevitably caused the premature convergence and imbalance of exploration and exploitation. In order to alleviate these drawbacks, in this paper, we propose a new variant of GSA, namely stability constrained adaptive alpha for GSA (SCAA). In SCAA, each agent’s evolutionary state is estimated, which is then combined with the variation of the agent’s position and fitness feedback to adaptively adjust the value of α. Moreover, to preserve agents’ stable trajectories and improve convergence precision, a boundary constraint is derived from the stability conditions of GSA to restrict the value of α in each iteration. The performance of SCAA has been evaluated by comparing with the original GSA and four alpha adjusting algorithms on 13 conventional functions and 15 complex CEC2015 functions. The experimental results have demonstrated that SCAA has significantly better searching performance than its peers do