IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v34y1987i2p281-292.html
   My bibliography  Save this article

Optimal selection of the t best of a sequence with sampling cost

Author

Listed:
  • Hwa‐Ming Yang

Abstract

This article deals with the problem of selecting the t best of n independent and identically distributed random variables which are observed sequentially with sampling cost c per unit. Assume that a decision for acceptance or rejection must be made after each sampling and that the reward for each observation with value x is given by px ‐ c, where p is 1 if the observation is accepted, or 0 otherwise. The optimal decision procedure (strategy) for maximizing the total expected reward is obtained. The critical numbers which are necessary to carry out the optimal decision procedure is presented by two recursive equations. The limit values of the critical numbers and the expected sample size are also studied.

Suggested Citation

  • Hwa‐Ming Yang, 1987. "Optimal selection of the t best of a sequence with sampling cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 281-292, April.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:2:p:281-292
    DOI: 10.1002/1520-6750(198704)34:23.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198704)34:23.0.CO;2-8
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198704)34:23.0.CO;2-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    2. S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Arash Khatibi & Sheldon H. Jacobson, 2016. "Doubly Stochastic Sequential Assignment Problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 124-137, March.
    2. Xuanming Su & Stefanos A. Zenios, 2005. "Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model," Operations Research, INFORMS, vol. 53(3), pages 443-455, June.
    3. Sofronov, Georgy, 2013. "An optimal sequential procedure for a multiple selling problem with independent observations," European Journal of Operational Research, Elsevier, vol. 225(2), pages 332-336.
    4. Tianke Feng & Joseph C. Hartman, 2015. "The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 267-292, June.
    5. Meghan Shanks & Ge Yu & Sheldon H. Jacobson, 2023. "Approximation algorithms for stochastic online matching with reusable resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 43-56, August.
    6. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
    7. Yizhaq Minchuk & Aner Sela, 2018. "Asymmetric sequential search under incomplete information," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 27(2), pages 315-325, June.
    8. Golshid Baharian & Sheldon H. Jacobson, 2013. "Limiting behavior of the stochastic sequential assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 321-330, June.
    9. Dirk Bergemann & Juuso Välimäki, 2019. "Dynamic Mechanism Design: An Introduction," Journal of Economic Literature, American Economic Association, vol. 57(2), pages 235-274, June.
    10. Yen‐Ming Lee & Sheldon M. Ross, 2013. "Bayesian selling problem with partial information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(7), pages 557-570, October.
    11. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
    12. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    13. Sheldon Ross & David Wu, 2013. "A generalized coupon collecting model as a parsimonious optimal stochastic assignment model," Annals of Operations Research, Springer, vol. 208(1), pages 133-146, September.
    14. moldovanu, benny & Gershkov, Alex, 2007. "The Dynamic Assignment of Heterogenous Objects: A Mechanism Design Approach," CEPR Discussion Papers 6439, C.E.P.R. Discussion Papers.
    15. Ahn, Jae-Hyeon & Kim, John J., 1998. "Action-timing problem with sequential Bayesian belief revision process," European Journal of Operational Research, Elsevier, vol. 105(1), pages 118-129, February.
    16. Egozcue, Martin & Fuentes García, Luis & Zitikis, Ricardas, 2012. "An optimal strategy for maximizing the expected real-estate selling price: accept or reject an offer?," MPRA Paper 40694, University Library of Munich, Germany.
    17. Tapan Biswas & Jolian Mchardy, 2012. "Asking Price And Price Discounts: The Strategy Of Selling An Asset Under Price Uncertainty," Review of Economic Analysis, Digital Initiatives at the University of Waterloo Library, vol. 4(1), pages 17-37, June.
    18. Gerald Häubl & Benedict G. C. Dellaert & Bas Donkers, 2010. "Tunnel Vision: Local Behavioral Influences on Consumer Decisions in Product Search," Marketing Science, INFORMS, vol. 29(3), pages 438-455, 05-06.
    19. Francis Bloch & Nicolas Houy, 2012. "Optimal assignment of durable objects to successive agents," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(1), pages 13-33, September.
    20. Gershkov, Alex & Moldovanu, Benny, 2012. "Dynamic allocation and pricing: A mechanism design approach," International Journal of Industrial Organization, Elsevier, vol. 30(3), pages 283-286.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:34:y:1987:i:2:p:281-292. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.