Co-evolving automata negotiate with a variety of opponents
Real-life negotiations typically involve multiple parties with different preferences for the different issues and bargaining strategies which change over time. Such a dynamic environment (with imperfect information) is addressed in this paper with a multi-population evolutionary algorithm (EA). Each population represents an evolving collection of bargaining strategies in our setup. The bargaining strategies are represented by a special kind of finite automata, which require only two transitions per state. We show that such automata (with a limited complexity) are a suitable choice in a computational setting. We furthermore describe an EA which generates highly-efficient bargaining automata in the course of time. A series of computational experiments shows that co-evolving automata are able to discriminate successfully between different opponents, although they receive no explicit information about the identity or preferences of their opponents. These results are important for the further development of evolving automata for real-life (agent system) applications.
|Optimization (acm G.1.6), Learning (acm I.2.6), Problem Solving, Control Methods, and Search (acm I.2.8)|
|Learning and adaptive systems (msc 68T05), Problem solving (heuristics, search strategies, etc.) (msc 68T20), 2-person games (msc 91A05), Noncooperative games (msc 91A10), Games in extensive form (msc 91A18), Multistage and repeated games (msc 91A20), Evolutionary games (msc 91A22), Rationality, learning (msc 91A26)|
|Software (theme 1), Logistics (theme 3), Energy (theme 4)|
|Software Engineering [SEN]|
|Organisation||Intelligent and autonomous systems|
van Bragt, D.D.B, & La Poutré, J.A. (2002). Co-evolving automata negotiate with a variety of opponents. Software Engineering [SEN]. CWI.