Internet Auctions with Artificial Adaptive Agents
The growing number of auction sites on the internet enable game theorists to ask strategic questions on rationality of the observed bidding behavior. The most popular of them (eBay, Amazon.com, AuctionWatch.com and Yahoo!, etc.) operate under similar sets of rules with seemingly small differences. They implement types of ascending-bid auctions and can strategically differ from a single-round sealed-bid second-price auction.\t The major difference between auction formats is about their ending procedures (as described in the paper). Most of the bidding activity is observed in the final hour of the auctions. Hence, the seemingly small difference in auction ending can cause later bids in the eBay auctions than Amazon.com. In this paper, I try to investigate the evolution of bidding patterns in internet auctions. I investigate evolutionary stability of late and multiple bidding in the private-value and common-value frameworks. I use adaptive artificial agent markets in the analysis. I seek similarities between the simulation data and actual human bidding behavior. I implement discrete finite time, sequential and repeated auctions in our simulations. In this paper, I show that common- and private-value auctions can evolutionarily lead to multiple and late bidding. I observe that artificial agent late bidding is in much more frequency in eBay auctions than Amazon.com in the private-value format (i.e. computer auctions). With common values (i.e. antique auctions), expert artificial bidders bid later more frequently than naive ones. The eBay auctions stage more frequent late bidding in the eBay auctions than in Amazon.com when there is a single naive bidder. Otherwise, auctions in Amazon.com cause more late bidding. I observe that eBay auctions generate in general less average revenue for sellers. They also cause more average profit for bidders in the private-value model. For the common-value model, bidders are indifferent betIen the two formats: each can dominate the other for different number of bidders. I also test the robustness of the results under different sets of parameters.\t
|Date of creation:||01 Apr 2001|
|Contact details of provider:|| Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html|
More information through EDIRC
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 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.
- Haruvy, Ernan & Roth, Alvin E. & Unver, M. Utku, 2006. "The dynamics of law clerk matching: An experimental and computational investigation of proposals for reform of the market," Journal of Economic Dynamics and Control, Elsevier, vol. 30(3), pages 457-486, March.
- Ernan Haruvy & Alvin E. Roth & M. Utku Unver, 2004. "The Dynamics of Law Clerk Matching: An Experimental and Computational Investigation of Proposals for Reform of the Market," Experimental 0404001, EconWPA.
- 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.
- Bullard, James & Duffy, John, 1999. "Using Genetic Algorithms to Model the Evolution of Heterogeneous Beliefs," Computational Economics, Springer;Society for Computational Economics, vol. 13(1), pages 41-60, February.
- James B. Bullard & John Duffy, 1994. "Using genetic algorithms to model the evolution of heterogeneous beliefs," Working Papers 1994-028, Federal Reserve Bank of St. Louis.
- James Bullard & John Duffy, 2010. "Using genetic algorithms to model the evolution of heterogenous beliefs," Levine's Working Paper Archive 550, David K. Levine.
- Bullard, James & Duffy, John, 1998. "A model of learning and emulation with artificial adaptive agents," Journal of Economic Dynamics and Control, Elsevier, vol. 22(2), pages 179-207, February.
- James B. Bullard & John Duffy, 1994. "A model of learning and emulation with artificial adaptive agents," Working Papers 1994-014, Federal Reserve Bank of St. Louis.
- Andreoni James & Miller John H., 1995. "Auctions with Artificial Adaptive Agents," Games and Economic Behavior, Elsevier, vol. 10(1), pages 39-64, July.
- Patrick Bajari & Ali Hortacsu, 2000. "Winner's Curse, Reserve Prices and Endogenous Entry: Empirical Insights from eBay Auctions," Econometric Society World Congress 2000 Contributed Papers 1927, Econometric Society.
- M. Utku Ünver, 2005. "On the survival of some unstable two-sided matching mechanisms," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(2), pages 239-254, 06.
- M. Utku Ünver, 2001. "On the Survival of Some Unstable Two-Sided Matching Mechanisms," Experimental 0111001, EconWPA, revised 01 Nov 2003.
- 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.
- McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
- Ariel Rubinstein, 1997. "Modeling Bounded Rationality," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262681005, July.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:38. 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: (Christopher F. Baum)
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.