Genetic Algorithms for Automated Negotiations: A FSM-Based Application Approach

Authors:
M. T. Tu;E. Wolff;W. Lamersdorf
Affiliations:
-;-;-
Venue:
DEXA '00 Proceedings of the 11th International Workshop on Database and Expert Systems Applications
Year:
2000

Citing 0
Cited 5

Using Genetic Algorithms to Enable Automated Auctions

EC-WEB '00 Proceedings of the First International Conference on Electronic Commerce and Web Technologies
Evolutionary Negotiation in Agent-Mediated Commerce

AMT '01 Proceedings of the 6th International Computer Science Conference on Active Media Technology
Learning algorithms for single-instance electronic negotiations using the time-dependent behavioral tactic

ACM Transactions on Internet Technology (TOIT)
Applying hybrid case-based reasoning in agent-based negotiations for supply chain management

Expert Systems with Applications: An International Journal
Tasks for agent-based negotiation teams: Analysis, review, and challenges

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to implement strategies for automated negotiations in electronic commerce applications is presented. It is based on genetic algorithms (GAs) that evolve FSMs (finite state machines). Each of these FSMs represents a negotiation strategy that competes against other strategies and is modified over time according to the outcome of this competition by using GA principles. The paper gives an overview of negotiating agents and work related to the paper. Then the application of genetic algorithms to FSMs is presented and relevant details on the implementation are given.