No Time Limit and Time Limit Model of Multiple Round Dutch Auction Based on Genetic Network Programming

摘要

Nowadays, Dutch auction is used widely at online auction sites. To make online Dutch auction more efficient and more intelligent, it is useful to develop an agent using evolutionary computation which will be adaptive to different auction environments. In this paper, a Genetic Network Programming (GNP) based strategy for auction agents has been proposed to do auctions in multiple round Dutch Auction environments under two types of auction models, no time limit model and time limit model. GNP is a graph-based evolutionary method extended from Genetic Algorithms (GA) and Genetic Programming (GP), which can create optimal solutions by evolution. Although the application of GNP to English auction has been done already, here, a new GNP structure is used for Dutch auction. The simulation results show that the GNP based strategy can also make the agents work well in Dutch auction and the advanced GNP structure makes the agents perform better than that in English auction.