Author List: Bandyopadhyay, Subhajyoti; Bandyopadhyay, Seema;
Journal of Management Information Systems, 2009, Volume 26, Issue 3, Page 275-301.
Sellers in eBay are often small-business owners whose livelihood depends on fast turnaround of their cash flows. Unlike in traditional auctions, these sellers are content to sell as soon as some target price is reached. While a wealth of literature exists on the final rent of the various stakeholders in a traditional auction setting, what is of interest here is to estimate the time required to reach a certain bid level in ongoing auctions. This paper introduces an analytical model to estimate the time it takes an online auction to reach a prespecified price threshold. The motivation for the research is to avoid unnecessary delays in conducting the transaction. Specifying the right duration would benefit small sellers who would realize the revenue proceeds from the sale faster. To this end, we model the bidding process as an infinite quasi-birth-death process, characterized by bursts of rapid bidding and subsequent lulls. We obtain closed-form solutions for the transient probability distribution in the frequency domain of the bid prices in an ongoing auction, which are then used to compute the transient probability distributions in the time domain. Experienced auctioneers can use these results to estimate expected ending times for their auctions. Sample observations from online auctions indicate that there may be potential room for improvement for sellers in setting their auction ending times. Simulations of the quasi-birth-death processes back up the theoretical observations.
Keywords: "buy it now" price; auction bid price; auction cash turnaround time; auctions; correlated random walk; electronic auctions; quasi-birth-death process; small business; transient analysis
Algorithm:

List of Topics

#91 0.314 auctions auction bidding bidders bid combinatorial bids online bidder strategies sequential prices design price using outcomes behavior theoretical computational efficiency
#97 0.138 set approach algorithm optimal used develop results use simulation experiments algorithms demonstrate proposed optimization present analytical distribution selection number existing
#62 0.086 price buyers sellers pricing market prices seller offer goods profits buyer two-sided preferences purchase intermediary traditional marketplace decisions intermediaries selling
#69 0.076 process business reengineering processes bpr redesign paper research suggests provide past improvements manage enable organizations regarding focal cycle creating issues
#50 0.075 financial crisis reporting report crises turnaround intelligence reports cash forecasting situations time status adequately weaknesses selective impact systemic power described
#187 0.067 learning model optimal rate hand domain effort increasing curve result experts explicit strategies estimate acquire learn referral observational skills activities
#34 0.059 negotiation negotiations using potential power agreement paper bases partners ending negotiators offers visualization messaging instant audio e-marketplaces provide positions agents
#193 0.052 time use size second appears form larger benefits combined studies reasons selected underlying appear various significantly result include make attention