GANGSTER: an Automated Negotiator Applying Genetic Algorithms
Negotiation is an essential skill for agents in a multiagent system. Much work has been published on this subject, but traditional approaches assume negotiators are able to evaluate all possible deals and pick the one that is best according to some negotiation strategy. Such an approach fails when t...
| Autores: | , |
|---|---|
| Tipo de recurso: | otro |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/130826 |
| Acceso en línea: | http://hdl.handle.net/10261/130826 |
| Access Level: | acceso abierto |
| Palabra clave: | Automated negotiation Non-linear utility Genetic algorithms |
| Sumario: | Negotiation is an essential skill for agents in a multiagent system. Much work has been published on this subject, but traditional approaches assume negotiators are able to evaluate all possible deals and pick the one that is best according to some negotiation strategy. Such an approach fails when the set of possible deals is too large to analyze exhaustively. For this reason the Annual Negotiating Agents Competition of 2014 has focused on negotiations over very large agreement spaces. In this paper we present a negotiating agent that explores the search space by means of a Genetic Algorithm. It has participated in the competition successfully and finished in 2nd and 3rd place in the two categories of the competition respectively. |
|---|