Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 52, No. 3, May-June 2004, pp. 346-367
DOI: 10.1287/opre.1040.0105
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Ryzin, G.
Right arrow Articles by Vulcano, G.
Right arrow Search for Related Content

Optimal Auctioning and Ordering in an Infinite Horizon Inventory-Pricing System

Garrett Ryzin, Gustavo Vulcano

Graduate School of Business, Columbia University, 412 Uris Hall, New York, New York 10027
Stern School of Business, New York University, New York, New York 10012

gjv1{at}columbia.edu
gvulcano{at}stern.nyu.edu

We consider a joint inventory-pricing problem in which buyers act strategically and bid for units of a firm's product over an infinite horizon. The number of bidders in each period as well as the individual bidders' valuations are random but stationary over time. There is a holding cost for inventory and a unit cost for ordering more stock from an outside supplier. Backordering is not allowed. The firm must decide how to conduct its auctions and how to replenish its stock over time to maximize its profits. We show that the optimal auction and replenishment policy for this problem is quite simple, consisting of running a standard first-price or second-price auction with a fixed reserve price in each period and following an order-up-to (basestock) policy for replenishing inventory at the end of each period. Moreover, the optimal basestock level can be easily computed. We then compare this optimal basestock, reserve-price-auction policy to a traditional basestock, list-price policy. We prove that in the limiting case of one buyer per period and in the limiting case of a large number of buyers per period and linear holding cost, list pricing is optimal. List pricing also becomes optimal as the holding cost tends to zero. Numerical comparisons confirm these theoretical results and show that auctions provide significant benefits when: (1) the number of buyers is moderate, (2) holding costs are high, or (3) there is high variability in the number of buyers per period.

Subject classifications: optimal auction; pricing; dynamic programming; infinite horizon; inventory control; basestock policy.
History: Received March 2002; revision received November 2002; accepted March 2003.




This article has been cited by other articles:


Home page
MSOMHome page
Y.-J. Chen and G. Vulcano
Effects of Information Disclosure Under First- and Second-Price Auctions in a Supply Chain Setting
MSOM, April 1, 2009; 11(2): 299 - 316.
[Abstract] [PDF]


Home page
Management ScienceHome page
W. T. Huh and G. Janakiraman
Inventory Management with Auctions and Other Sales Channels: Optimality of (s, S) Policies
Management Science, January 1, 2008; 54(1): 139 - 150.
[Abstract] [PDF]


Home page
Management ScienceHome page
R. Caldentey and G. Vulcano
Online Auction and List Price Revenue Management
Management Science, May 1, 2007; 53(5): 795 - 813.
[Abstract] [PDF]


Home page
MSOMHome page
H. Etzion, E. Pinker, and A. Seidmann
Analyzing the Simultaneous Use of Auctions and Posted Prices for Online Selling
MSOM, January 1, 2006; 8(1): 68 - 91.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.