Learning Environmental Parameters for the Design of Optimal English Auctions with Discrete Bid Levels

  • A. Rogers
  • , E. David
  • , J. Schiff
  • , S. Kraus
  • , N. R. Jennings

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this paper we consider the optimal design of English auctions with discrete bid levels. Such auctions are widely used in online internet settings and our aim is to automate their configuration in order that they generate the maximum revenue for the auctioneer. Specifically, we address the problem of estimating the values of the parameters necessary to perform this optimal auction design by observing the bidding in previous auctions. To this end, we derive a general expression that relates the expected revenue of the auction when discrete bid levels are implemented, but the number of participating bidders is unknown. We then use this result to show that the characteristics of these optimal bid levels are highly dependent on the expected number of bidders and on their valuation distribution. Finally, we derive and demonstrate an online algorithm based on Bayesian machine learning, that allows these unknown parameters to be estimated through observations of the closing price of previous auctions. We show experimentally that this algorithm converges rapidly toward the true parameter values and, in comparison with an auction using the more commonly implemented fixed bid increment, results in an increase in auction revenue.
Original languageAmerican English
Title of host publicationAgent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms
EditorsHan La Poutré, Norman M. Sadeh, Sverker Janson
Place of PublicationBerlin
PublisherSpringer
Pages1-15
Volume3937
StatePublished - 2006

Publication series

NameLecture Notes in Computer Science

Fingerprint

Dive into the research topics of 'Learning Environmental Parameters for the Design of Optimal English Auctions with Discrete Bid Levels'. Together they form a unique fingerprint.

Cite this