Modeling complex multi-issue negotiations using utility graphs
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Using iterative narrowing to enable multi-party negotiations with multiple interdependent issues
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Multiagent and Grid Systems - Negotiation and Scheduling Mechanisms for Multiagent Systems
The crowding approach to niching in genetic algorithms
Evolutionary Computation
Hi-index | 0.00 |
In this paper, a non-mediated multi-issue bilateral bargaining model for complex utility functions is presented. Before the negotiation process, a genetic algorithm (GA) is used to sample one's own utility function. During the negotiation process, genetic operators are applied over the opponent's and one's own proposals in order to sample new proposals that are interesting for both parties.