Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T13:23:34.777Z Has data issue: false hasContentIssue false
  • English
  • Français

A Weakest Link Marked Stopping Problem

Published online by Cambridge University Press:  14 July 2016

Steven A. Lippman ,
Sheldon M. Ross  and
Sridhar Seshadri
Steven A. Lippman*
Affiliation:
University of California, Los Angeles
Sheldon M. Ross*
Affiliation:
University of Southern California
Sridhar Seshadri*
Affiliation:
New York University
*
∗Postal address: Anderson Graduate School of Management, University of California, Los Angeles, CA 90095, USA.
∗∗Postal address: Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA. Email address: [email protected]
∗∗∗Postal address: Department of Information, Operations, and Management Science, Leonard Stern School of Business, New York University, New York, NY 10012, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a model in which we have k items to be sold. Potential buyers make offers in a sequential fashion. Once made, the offer is either rejected or marked for acceptance. Once k items have been marked, the items are then sold to the buyers whose offers were marked, but at a price equal to the minimum of the k marked offers. Assuming that the successive offers are independent and identically distributed according to a specified distribution and that there is a fixed cost incurred whenever an offer is rejected, we determine structural results about the optimal policy, present computational approaches for finding the optimal policy, and give some heuristic policies.

Keywords

Marked stopping problemweakest linkstructure of optimal policyonline heuristic

MSC classification

Secondary: 90C39: Dynamic programming 90C40: Markov and semi-Markov decision processes
Type
Research Papers
Information
Journal of Applied Probability , Volume 44 , Issue 4 , December 2007 , pp. 843 - 851
Copyright
Copyright © Applied Probability Trust 2007 

References

[1] Bruss, F. T., and Ferguson, T. S. (1997). Multiple buying or selling with vector offers. J. Appl. Prob. 34, 959–973.Google Scholar
[2] Lippman, S. and Ross, S. M. (2007). Variability is beneficial in marked stopping problems. To appear in Econom. Theory.Google Scholar
[3] MacQueen, J. B. and Miller, R. G. Jr. (1960). Optimal persistence policies. Operat. Res. 8, 362–380.Google Scholar
[4] Milgrom, P. (2004). Putting Auction Theory to Work. Cambridge University Press.Google Scholar
[5] Ross, S. M. (1983). Introduction to Stochastic Dynamic Programming. Academic Press, San Diego, CA.Google Scholar
[6] Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. J. Finance XVI, 8–37.CrossRefGoogle Scholar