A Variable Bid Increment Algorithm for Reverse English Auction
Pinson, Suzanne; Brigui, Imène (2010), A Variable Bid Increment Algorithm for Reverse English Auction, in Pellizzari, Paolo; Milone, Lucia; Li Calzi, Marco, Progress in Artificial Economics, Springer : Berlin, p. 41-51
TypeCommunication / Conférence
Book titleProgress in Artificial Economics
Book authorPellizzari, Paolo; Milone, Lucia; Li Calzi, Marco
Series titleLecture Notes in Economics and Mathematical Systems
Number of pages100
MetadataShow full item record
Institut Supérieur de Gestion Paris [GrIIsG]
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)In this paper we propose multicriteria strategies for conducting automated reverse English auctions based on software agents. Reverse auctions gained popularity as a result of the emergence of Internet-based online auction tools. A buyer agent negotiates with several seller agents over a single product. The preference model is based on reference points which represent the desired values and the reservation values over each criterion. To insure process evolution, English auctions design often considers a bid increment that represents the minimal amount that a bidder must improve on the current best bid. Generally, the bid increment is fixed before the beginning of the process and kept invariant during the process. Our aim is to allow adjusting the bid increment as the auction process progresses. We propose an anytime algorithm based on an exponential smoothing method that adapts the bid increment to the auction context.
Subjects / Keywordsalgorithm; bid increment; Reverse English Auction; multicriteria strategies
Showing items related by title and author.
Pinson, Suzanne; Bellosta, Marie-Jo; Vanderpooten, Daniel; Brigui, Imène; Kornman, Sylvie (2007) Article accepté pour publication ou publié