Internet auctions with artificial adaptive agents: A study on market design
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.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
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.:
- Paul Milgrom & Robert J. Weber, 1981.
"A Theory of Auctions and Competitive Bidding,"
447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jim Engle-Warnick & Robert Slonim, 2006.
"Inferring repeated-game strategies from actions: evidence from trust game experiments,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 28(3), pages 603-632, 08.
- Jim Engle-Warnick & Robert L. Slonim, 2001. "Inferring Repeated Game Strategies From Actions: Evidence From Trust Game Experiments," Economics Papers 2001-W13, Economics Group, Nuffield College, University of Oxford.
- Christopher Avery, 1998. "Strategic Jump Bidding in English Auctions," Review of Economic Studies, Oxford University Press, vol. 65(2), pages 185-210.
- Alvin E. Roth & Axel Ockenfels, 2002.
"Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet,"
American Economic Review,
American Economic Association, vol. 92(4), pages 1093-1103, September.
- Alvin E. Roth & Axel Ockenfels, "undated". "Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet," Papers on Strategic Interaction 2002-32, Max Planck Institute of Economics, Strategic Interaction Group.
- Patrick Bajari & Ali Hortaçsu, 2004. "Economic Insights from Internet Auctions," Journal of Economic Literature, American Economic Association, vol. 42(2), pages 457-486, June.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
- William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
- Ockenfels, Axel & Roth, Alvin E., 2006.
"Late and multiple bidding in second price Internet auctions: Theory and evidence concerning different rules for ending an auction,"
Games and Economic Behavior,
Elsevier, vol. 55(2), pages 297-320, May.
- Axel Ockenfels & Alvin E. Roth, 2003. "Late and Multiple Bidding in Second Price Internet Auctions: Theory and Evidence Concerning Different Rules for Ending an Auction," CESifo Working Paper Series 992, CESifo Group Munich.
- David Lucking-Reiley, 1999.
"Using field experiments to test equivalence between auction formats: Magic on the internet,"
Framed Field Experiments
00183, The Field Experiments Website.
- David Lucking-Reiley, 1999. "Using Field Experiments to Test Equivalence between Auction Formats: Magic on the Internet," American Economic Review, American Economic Association, vol. 89(5), pages 1063-1080, December.
- Arifovic, Jasmina, 2000. "Evolutionary Algorithms In Macroeconomic Models," Macroeconomic Dynamics, Cambridge University Press, vol. 4(03), pages 373-414, September.
- Miller, John H., 1996. "The coevolution of automata in the repeated Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 87-112, January.
- Holland, John H & Miller, John H, 1991. "Artificial Adaptive Agents in Economic Theory," American Economic Review, American Economic Association, vol. 81(2), pages 365-371, May.
- McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
- Andreoni James & Miller John H., 1995. "Auctions with Artificial Adaptive Agents," Games and Economic Behavior, Elsevier, vol. 10(1), pages 39-64, July.
When requesting a correction, please mention this item's handle: RePEc:eee:jeborg:v:67:y:2008:i:2:p:394-417. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.