Evolving Automata Negotiate with a Variety of Opponents
AbstractThe rapid growth of a global electronic market place, together with the establishment of standard negotiation protocols, currently leads to the development of multi-agent architectures in which artificial agents can negotiate on behalf of their users. Ideally, these agents should be able to negotiate successfully against a variety of opponents with different tactics and different preferences. Furthermore, they should be able to adapt their strategies to deal for instance with agents with different preferences. We show that such flexible and powerful bargaining agents can be obtained using the combination of finite automata and evolutionary algorithms (EAs). Finite automata allow the bargaining agents to behave differently against different opponents. EAs can be used to adapt the agents' bargaining strategies (consisting of finite automata) in successive steps to generate more and more successful strategies in the course of time. The performance of the evolving automata is assessed in a competition against a broad variety of bargaining strategies. Highly-efficient bargaining strategies, which discriminate successfully between opponents with different bargaining tactics, are generated by the EA. We also investigate the situation in which the opponents are also co-evolving (and have different preferences). Positive results are obtained in this setup as well. The evolving automata perform especially well when the bargaining game is very short and a fast discrimination between different opponents becomes necessary.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Society for Computational Economics in its series Computing in Economics and Finance 2001 with number 118.
Date of creation: 01 Apr 2001
Date of revision:
Contact details of provider:
Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html
More information through EDIRC
evolutionary algorithms; bargaining; finite automata;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Enrico Gerding & David van Bragt & Han La Poutré, 2003. "Multi-Issue Negotiation Processes by Evolutionary Simulation, Validation and Social Extensions," Computational Economics, Society for Computational Economics, vol. 22(1), pages 39-63, August.
- Martin J. Osborne & Ariel Rubinstein, 2005. "Bargaining and Markets," Levine's Bibliography 666156000000000515, UCLA Department of Economics.
- D.D.B. van Bragt, E.H. Gerding, J.A. La Poutre, . "Equilibrium Selection in Alternating-Offers Bargaining Models - The Evolutionary Computing Approach," The Electronic Journal of Evolutionary Modeling and Economic Dynamics, IFReDE - Université Montesquieu Bordeaux IV.
- Miller, John H., 1996. "The coevolution of automata in the repeated Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 87-112, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).
If references are entirely missing, you can add them using this form.