{'fraction_non_alphanumeric': 0.01664145234493192, 'fraction_numerical': 0.0, 'mean_word_length': 5.365384615384615, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Genetic algorithms for automated negotiations: a FSM-based application approach

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.