We develop a model of internet auctions with the aim of understanding how rules for ending such auctions (a "hard"- or "soft"-close) affect bidding behavior. We model bidding strategies using finite automata and report results from simulations involving populations of artificial bidders who update their strategies using a genetic algorithm. Our model is shown to deliver late or early bidding behavior, depending on whether the auction has a hard- or soft-close rule in accordance with the empirical evidence. We report on other interesting properties of our model and offer some conclusions from a market design point of view.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 67 (2008) Issue (Month): 2 (August) Pages: 394-417 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)