Internet Auctions with Artificial Adaptive Agents: A Study on Market Design
Many internet auction sites implement ascending-bid, second-price auctions. Empirically, lastminute or “late” bidding is frequently observed in “hard-close” but not in “soft-close” versions of these auctions. In this paper, we introduce an independent private-value repeated internet auction model to explain this observed difference in bidding behavior. We use finite automata to model the repeated auction strategies. We report results from simulations involving populations of artificial bidders who update their strategies via a genetic algorithm. We show that our model can deliver late or early bidding behavior, depending on the auction closing rule in accordance with the empirical evidence. As an interesting result, we observe that hard-close auctions raise less revenue than soft-close auctions. We also investigate interesting properties of the evolving strategies and arrive at some conclusions regarding both auction designs from a market design point of view.
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.:
- Jim Engle-Warnick & Robert L. Slonim, 2001.
"Inferring Repeated Game Strategies From Actions: Evidence From Trust Game Experiments,"
2001-W13, Economics Group, Nuffield College, University of Oxford.
- Jim Engle-Warnick & Robert Slonim, 2006. "Inferring repeated-game strategies from actions: evidence from trust game experiments," Economic Theory, Springer, 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 Series Working Papers 2001-W13, University of Oxford, Department of Economics.
- 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.
- 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.
- 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.
- 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.
- 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.
- Alvin E. Roth & Axel Ockenfels, .
"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.
- 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.
- Avery, Christopher, 1998. "Strategic Jump Bidding in English Auctions," Review of Economic Studies, Wiley Blackwell, vol. 65(2), pages 185-210, April.
- William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
- Andreoni James & Miller John H., 1995. "Auctions with Artificial Adaptive Agents," Games and Economic Behavior, Elsevier, vol. 10(1), pages 39-64, July.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
- Holland, John H & Miller, John H, 1991. "Artificial Adaptive Agents in Economic Theory," American Economic Review, American Economic Association, vol. 81(2), pages 365-71, May.
- 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.
- Arifovic, Jasmina, 2000. "Evolutionary Algorithms In Macroeconomic Models," Macroeconomic Dynamics, Cambridge University Press, vol. 4(03), pages 373-414, September.
- 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.
- McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpco:0510001. 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: (EconWPA)
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.