ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Electronic Commerce Research and Applications
Volume 6, Issue 2, Summer 2007, Pages 192-208
Ninth Pacific Asia Conference on Information Systems (PACIS 2005) - IT and Value Creation
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1376 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.elerap.2006.07.003    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Two-level workload characterization of online auctions

Vasudeva Akulaa and Daniel A. Menascéb, Corresponding Author Contact Information, E-mail The Corresponding Author

aThe Volgenau School of Information Technology and Engineering, George Mason University, Fairfax, VA 22033, USA bDepartment of Computer Science, George Mason University, Fairfax, VA 22033, USA

Received 11 February 2005; 
revised 23 December 2005; 
accepted 4 July 2006. 
Available online 11 September 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Online auctions are rapidly becoming one of the significant forms of electronic commerce for buying and selling goods and services. A good understanding of the workload of auction sites should provide insights about their activities and help in improving the quality of the service provided to their users. This paper presents a site level and a user level workload characterization of a real online auction site using data collected by automated agents. The main contributions of this paper are as follows: (i) a detailed workload characterization of a real auction site; (ii) an analysis of the presence of heavy tailed distributions in this workload; (iii) an analysis of the bidding activity during closing minutes of auctions; and (iv) an analysis of the arrival rate process of bidders and bids within clusters based on different attributes. These results can be used to devise dynamic pricing and promotion models to improve revenue throughput of online auction sites.

Keywords: Internet auctions; Workload characterization; Auction workloads; Online auction site performance

Article Outline

1. Introduction
2. Basic terms and notation
3. Motivation and approach
4. Experimental setup
4.1. Data collection
4.2. Auction duration
5. Site level workload characterization
5.1. Cluster analysis
5.1.1. Clustering auctions on the number of unique bidders
5.1.2. Clustering of auctions on number of bids
5.1.3. Distribution of bids per auction
5.1.4. Clustering of auctions using closing prices
5.2. Multi-scale analysis of auctions and bids
5.2.1. Multi-scale analysis of auctions
5.2.2. Multi-scale analysis of bids
5.3. Closing time analysis
5.3.1. Closing time analysis of bidding activity
5.3.2. Closing time analysis of price variation
5.3.3. Last hour analysis
5.4. Arrival process of auctions and bids
5.4.1. Inter-arrival process of auctions
5.4.2. Inter-arrival process of bids
6. User level workload characterization
6.1. Popularity analysis
6.1.1. Winner’s popularity
6.1.2. Seller’s popularity
6.1.3. Bidder’s popularity
6.1.4. Popularity of auctions
6.1.5. Popularity of categories
6.2. Analysis of unique bidder clusters
6.2.1. Unique bidder arrival rate
6.2.2. Bidding activity
6.2.3. Bids by agents, manual bids, proxy agent usage
6.2.4. Closing price
6.2.5. Successful auctions
6.3. Analysis of price clusters
6.3.1. Bidding activity
6.3.2. Unique bidders and agent usage
6.3.3. Winners
7. Concluding remarks
References






































Electronic Commerce Research and Applications
Volume 6, Issue 2, Summer 2007, Pages 192-208
Ninth Pacific Asia Conference on Information Systems (PACIS 2005) - IT and Value Creation
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.