An optimal sequential procedure for a multiple selling problem with independent observations
We consider a sequential problem of selling K identical assets over the finite time horizon with a fixed number of offers per time period and no recall of past offers. The objective is to find an optimal sequential procedure which maximizes the total expected revenue. In this paper, we derive an effective number of stoppings for an optimal sequential procedure for the selling problem with independent observations.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Donald B. Rosenfield & Roy D. Shapiro & David A. Butler, 1983. "Optimal Strategies for Selling an Asset," Management Science, INFORMS, vol. 29(9), pages 1051-1061, September.
- Chun, Young H. & Plante, Robert D. & Schneider, Helmut, 2002. "Buying and selling an asset over the finite time horizon: A non-parametric approach," European Journal of Operational Research, Elsevier, vol. 136(1), pages 106-120, January.
- David, Israel, 1998. "Explicit results for a class of asset-selling problems," European Journal of Operational Research, Elsevier, vol. 110(3), pages 576-584, November.
- Preater, J., 1993. "A note on monotonicity in optimal multiple stopping problems," Statistics & Probability Letters, Elsevier, vol. 16(5), pages 407-410, April.
- S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
- Lippman, Steven A & McCall, John J, 1976. "The Economics of Job Search: A Survey," Economic Inquiry, Western Economic Association International, vol. 14(3), pages 347-68, September.
- David, Israel & Levi, Ofer, 2001. "Asset-selling problems with holding costs," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 317-321, May.
- Stein, William E. & Seale, Darryl A. & Rapoport, Amnon, 2003. "Analysis of heuristic solutions to the best choice problem," European Journal of Operational Research, Elsevier, vol. 151(1), pages 140-152, November.
- Lippman, Steven A & McCall, John J, 1976. "The Economics of Job Search: A Survey: Part I," Economic Inquiry, Western Economic Association International, vol. 14(2), pages 155-89, June.
- S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:225:y:2013:i:2:p:332-336. 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: (Zhang, Lei)
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.