Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 53, No. 5, May 2007, pp. 795-813
DOI: 10.1287/mnsc.1060.0646
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
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 Caldentey, R.
Right arrow Articles by Vulcano, G.
Right arrow Search for Related Content

Online Auction and List Price Revenue Management

René Caldentey, Gustavo Vulcano

Stern School of Business, New York University, 44 West Fourth Street, New York, New York 10012
Stern School of Business, New York University, 44 West Fourth Street, New York, New York 10012

rcaldent{at}stern.nyu.edu
gvulcano{at}stern.nyu.edu

We analyze a revenue management problem in which a seller facing a Poisson arrival stream of consumers operates an online multiunit auction. Consumers can get the product from an alternative list price channel. We consider two variants of this problem: In the first variant, the list price is an external channel run by another firm. In the second one, the seller manages both the auction and the list price channels.

Each consumer, trying to maximize his own surplus, must decide either to buy at the posted price and get the item at no risk, or to join the auction and wait until its end, when the winners are revealed and the auction price is disclosed.

Our approach consists of two parts. First, we study structural properties of the problem, and show that the equilibrium strategy for both versions of this game is of the threshold type, meaning that a consumer will join the auction only if his arrival time is above a function of his own valuation. This consumer’s strategy can be computed using an iterative algorithm in a function space, provably convergent under some conditions. Unfortunately, this procedure is computationally intensive.

Second, and to overcome this limitation, we formulate an asymptotic version of the problem, in which the demand rate and the initial number of units grow proportionally large. We obtain a simple closed-form expression for the equilibrium strategy in this regime, which is then used as an approximate solution to the original problem. Numerical computations show that this heuristic is very accurate. The asymptotic solution culminates in simple and precise recipes of how bidders should behave, as well as how the seller should structure the auction, and price the product in the dual-channel case.

Key Words: revenue management; online auction; dual channel; strategic behavior; asymptotic analysis
History: Received: February 19, 2004;


This article has been cited by other articles:


Home page
Management ScienceHome page
R. Yin, Y. Aviv, A. Pazgal, and C. S. Tang
Optimal Markdown Pricing: Implications of Inventory Display Formats in the Presence of Strategic Customers
Management Science, August 1, 2009; 55(8): 1391 - 1408.
[Abstract] [PDF]


Home page
Management ScienceHome page
X. Su and F. Zhang
Strategic Customer Behavior, Commitment, and Supply Chain Performance
Management Science, October 1, 2008; 54(10): 1759 - 1773.
[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
J. Gallien and S. Gupta
Temporary and Permanent Buyout Prices in Online Auctions
Management Science, May 1, 2007; 53(5): 814 - 833.
[Abstract] [PDF]




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