Why Agents for Automated Negotiations Should Be Adaptive

  • Authors:
  • D. D. B. Van Bragt;J. A. La Poutré

  • Affiliations:
  • CWI, Centre for Mathematics and Computer Science, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;CWI, Centre for Mathematics and Computer Science, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands, TUE, Eindhoven University of Technology, Department of Technology Management, De Lismortel 2, ...

  • Venue:
  • Netnomics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that adaptive agents on the Internet can learn to exploit bidding agents who use a (limited) number of fixed strategies. These learning agents can be generated by adapting a special kind of finite automata with evolutionary algorithms (EAs). Our approach is especially powerful if the adaptive agent participates in frequently occurring micro-transactions, where there is sufficient opportunity for the agent to learn online from past negotiations. More in general, results presented in this paper provide a solid basis for the further development of adaptive agents for Internet applications.