Revenue Management with Forward-Looking Buyers
We consider a seller who wishes to sell K goods by time T. Potential buyers enter IID over time and are forward-looking, so can strategically time their purchases. At any point in time, profit is maximized by awarding the good to the agent with the highest valuation exceeding a cutoff. These cutoffs are characterized by a one-period-look-ahead rule and are deterministic, depending only on the number of units and time remaining. The cutoffs decrease over time and in the inventory size, and are independent of the buyers' arrival times. In the continuous time limit, the seller's profits are maximized by posting anonymous prices, with an auction for the last unit at time T. Unlike the cutoffs, the optimal prices depend on the history of past sales.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||2011|
|Contact details of provider:|| Postal: Society for Economic Dynamics Marina Azzimonti Department of Economics Stonybrook University 10 Nicolls Road Stonybrook NY 11790 USA|
Web page: http://www.EconomicDynamics.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680.
- Raymond Deneckere & James Peck, 2012. "Dynamic Competition With Random Demand and Costless Search: A Theory of Price Posting," Econometrica, Econometric Society, vol. 80(3), pages 1185-1247, 05.
- McAfee, R. Preston & McMillan, John, 1987. "Auctions with a stochastic number of bidders," Journal of Economic Theory, Elsevier, vol. 43(1), pages 1-19, October.
- Andrew Sweeting, 2012. "Dynamic Pricing Behavior in Perishable Goods Markets: Evidence from Secondary Markets for Major League Baseball Tickets," Journal of Political Economy, University of Chicago Press, vol. 120(6), pages 1133-1172.
- Kruse, Thomas & Strack, Philipp, 2015. "Optimal stopping with private information," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 702-727.
- Gonca P. Soysal & Lakshman Krishnamurthi, 2012. "Demand Dynamics in the Seasonal Goods Industry: An Empirical Analysis," Marketing Science, INFORMS, vol. 31(2), pages 293-316, March.
When requesting a correction, please mention this item's handle: RePEc:red:sed011:87. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.