ACM Home Page
Please provide us with feedback. Feedback
Accelerating information revelation in ascending-bid auctions: avoiding last minute bidding
Full text PdfPdf (171 KB)
Source Electronic Commerce archive
Proceedings of the 3rd ACM conference on Electronic Commerce table of contents
Tampa, Florida, USA
Pages: 29 - 37  
Year of Publication: 2001
ISBN:1-58113-387-1
Author
Shigeo Matsubara  NTT Corporation, Soraku-gun, Kyoto, Japan
Sponsor
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 26,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/501158.501162
What is a DOI?

ABSTRACT

An ascending-bid auction protocol with a fixed end time has been widely used at many Internet auction sites. At these sites, we can observe bidders engaging in the behavior called last minute bidding, namely, a large fraction of the bids for a good are submitted in the closing seconds of the auction. This can cause problems such as information revelation failure as well as server overload and network congestion. When bidders behave in this way, each of them cannot obtain information about the good from the other bidders' bidding behaviors, and this spoils the advantages of open-bid auctions. The result is an inefficient allocation of the good. To solve this problem, we propose a new protocol that gives each bidder an option to fix the maximum bid of a proxy agent and an incentive to submit a high bid at an early stage of an auction by paying compensation money. We examine the property of the protocol based on the game theory and clarify what situations our protocol outperforms the ordinary ascending-bid auction protocol by computer simulation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P.Bajari and A.Hortasu.Winner's curse,reserve prices and endogenous entry:Empirical insights from eBay auctions.Working Paper,2000.
 
2
S.Bikhchandani.Reputation in repeated second-price auctions.Journal of Economic Theory ,46:97 -119, 1988.
 
3
 
4
 
5
P.Milgrom and R.J.Weber.The value of information in a sealed-bid auction.Journal of Mathematical Economics ,10(1):105 -114,1982.
 
6
P.R.Milgrom and R.J.Weber.A theory of auctions and competitive bidding.Econometrica , 50(5):1089 -1122,1982.
 
7
8
 
9
E.Rasmusen.Games and Information .Basil Blackwell,1989.
 
10
A.E.Roth and A.Ockenfels.Last minute bidding and the rules for ending second-price auctions:Theory and evidence from a natural experimen on the internet. Working Paper,2000.
11
 
12
T.W.Sandholm.Limitation of the Vickrey auction in computational multiagen systems.In Proceedings of the Second International Conference on Multi-Agent Systems (ICMAS-96),pages 299 -306,1996.
 
13
M.P.Wellman,W.E.Walsh,P.R.Wurman,and J.K.MacKie-Mason.Auction protocols for decentralized scheduling.Games and Economic Behavior ,35(1):271 -303,2001.
 
14
R.T.Wilcox.Experts and amateurs:The role of experience in internet auctions.Marketing Letters , 11(4):363 -374,2000.
15
 
16