IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v208y2013i1p133-14610.1007-s10479-012-1086-5.html
   My bibliography  Save this article

A generalized coupon collecting model as a parsimonious optimal stochastic assignment model

Author

Listed:
  • Sheldon Ross
  • David Wu

Abstract

There is a given set of n boxes, numbered 1 thru n. Coupons are collected one at a time. Each coupon has a binary vector x 1 ,…,x n attached to it, with the interpretation being that the coupon is eligible to be put in box i if x i =1,i=1…,n. After a coupon is collected, it is put in a box for which it is eligible. Assuming the successive coupon vectors are independent and identically distributed from a specified joint distribution, the initial problem of interest is to decide where to put successive coupons so as to stochastically minimize N, the number of coupons needed until all boxes have at least one coupon. When the coupon vector X 1 ,…,X n is a vector of independent random variables, we show, if P(X i =1) is nondecreasing in i, that the policy π that always puts an arriving coupon in the smallest numbered empty box for which it is eligible is optimal. Efficient simulation procedures for estimating P π (N>r) and E π [N] are presented; and analytic bounds are determined in the independent case. We also consider the problem where rearrangements are allowed. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:133-146:10.1007/s10479-012-1086-5
    DOI: 10.1007/s10479-012-1086-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1086-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1086-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    2. Israel David & Uri Yechiali, 1985. "A Time-dependent Stopping Problem with Application to Live Organ Transplants," Operations Research, INFORMS, vol. 33(3), pages 491-504, June.
    3. 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.
    4. Chris Albright & Cyrus Derman, 1972. "Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem," Management Science, INFORMS, vol. 19(1), pages 46-51, September.
    5. Israel David & Uri Yechiali, 1995. "One-Attribute Sequential Assignment Match Processes in Discrete Time," Operations Research, INFORMS, vol. 43(5), pages 879-884, October.
    6. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. David T. Wu & Sheldon M. Ross, 2015. "A stochastic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 23-31, February.
    2. Sheldon M. Ross & Gideon Weiss & Zhengyu Zhang, 2021. "Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities," Operations Research, INFORMS, vol. 69(1), pages 266-272, January.

    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. 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.
    2. Sheldon M. Ross & Gideon Weiss & Zhengyu Zhang, 2021. "Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities," Operations Research, INFORMS, vol. 69(1), pages 266-272, January.
    3. 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.
    4. 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.
    5. Yael Deutsch & Israel David, 2020. "Benchmark policies for utility-carrying queues with impatience," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 97-120, June.
    6. David T. Wu & Sheldon M. Ross, 2015. "A stochastic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 23-31, February.
    7. 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.
    8. Sahar Ahmadvand & Mir Saman Pishvaee, 2018. "An efficient method for kidney allocation problem: a credibility-based fuzzy common weights data envelopment analysis approach," Health Care Management Science, Springer, vol. 21(4), pages 587-603, December.
    9. Kargar, Bahareh & Pishvaee, Mir Saman & Jahani, Hamed & Sheu, Jiuh-Biing, 2020. "Organ transportation and allocation problem under medical uncertainty: A real case study of liver transplantation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    10. Burhaneddin Sandıkçı & Lisa M. Maillart & Andrew J. Schaefer & Oguzhan Alagoz & Mark S. Roberts, 2008. "Estimating the Patient's Price of Privacy in Liver Transplantation," Operations Research, INFORMS, vol. 56(6), pages 1393-1410, December.
    11. Murat Kurt & Mark S. Roberts & Andrew J. Schaefer & M. Utku Ünver, 2011. "Valuing Prearranged Paired Kidney Exchanges: A Stochastic Game Approach," Boston College Working Papers in Economics 785, Boston College Department of Economics, revised 14 Oct 2011.
    12. Sakine Batun & Andrew J. Schaefer & Atul Bhandari & Mark S. Roberts, 2018. "Optimal Liver Acceptance for Risk-Sensitive Patients," Service Science, INFORMS, vol. 10(3), pages 320-333, September.
    13. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List," Operations Research, INFORMS, vol. 55(1), pages 24-36, February.
    14. Adrian Lee & Sheldon Jacobson, 2011. "Sequential stochastic assignment under uncertainty: estimation and convergence," Statistical Inference for Stochastic Processes, Springer, vol. 14(1), pages 21-46, February.
    15. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
    16. Hak Chun, Young, 1996. "Selecting the best choice in the weighted secretary problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 135-147, July.
    17. Mustafa Akan & Oguzhan Alagoz & Baris Ata & Fatih Safa Erenay & Adnan Said, 2012. "A Broader View of Designing the Liver Allocation System," Operations Research, INFORMS, vol. 60(4), pages 757-770, August.
    18. C G Lennon & J M McGowan & K Y Lin, 2008. "A game-theoretic model for repeated assignment problem between two selfish agents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1652-1658, December.
    19. Stefanos A. Zenios & Glenn M. Chertow & Lawrence M. Wein, 2000. "Dynamic Allocation of Kidneys to Candidates on the Transplant Waiting List," Operations Research, INFORMS, vol. 48(4), pages 549-569, August.
    20. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Choosing Among Living-Donor and Cadaveric Livers," Management Science, INFORMS, vol. 53(11), pages 1702-1715, November.

    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:spr:annopr:v:208:y:2013:i:1:p:133-146:10.1007/s10479-012-1086-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.