DocumentCode
529272
Title
A bidding strategy based on genetic network programming in continuous double auctions
Author
Yue, Chuan ; Mabu, Shingo ; Yu, Donggeng ; Wang, Yu ; Hirasawa, Kotaro
Author_Institution
Grad. Sch. of Inf., Production & Syst., Waseda Univ., Tokyo, Japan
fYear
2010
fDate
18-21 Aug. 2010
Firstpage
2620
Lastpage
2625
Abstract
Nowadays, along with the increasing convenience of internet, there becomes popular electronic type of doubleside auctions, continuous double auction (CDA), where multiple sellers and multiple buyers can update their asks and bids continuously at the same time through the trading period. In this paper, a bidding strategy using Genetic Network Programming (GNP) with Rectifying Node has been proposed to deal with CDA automatically based on our previous works of English auction and Dutch auction. The stategy considers various aspects of environments to determine the most competitive and suitable bid price at each time step without losing profit. The agent can manage complex CDA situations more effectively and efficiently by employing the GNP structure using the auction information and heuristic control functions. Experiments were conducted on a series of CDAs under different settings, and compared with some other methods.
Keywords
Internet; electronic commerce; evolutionary computation; genetic algorithms; Dutch auction; English auction; Internet; auction information; bidding strategy; continuous double auction; genetic network programming; heuristic control function; rectifying node; trading period; Bidding; Continuous Double Auctions; Genetic Network Programming;
fLanguage
English
Publisher
ieee
Conference_Titel
SICE Annual Conference 2010, Proceedings of
Conference_Location
Taipei
Print_ISBN
978-1-4244-7642-8
Type
conf
Filename
5602491
Link To Document