IDEAS home Printed from https://ideas.repec.org/a/bla/jorssc/v69y2020i3p607-621.html
   My bibliography  Save this article

An optimal design for hierarchical generalized group testing

Author

Listed:
  • Yaakov Malinovsky
  • Gregory Haber
  • Paul S. Albert

Abstract

Choosing an optimal strategy for hierarchical group testing is an important problem for practitioners who are interested in disease screening with limited resources. For example, when screening for infectious diseases in large populations, it is important to use algorithms that minimize the cost of potentially expensive assays. Black and co‐workers described this as an intractable problem unless the number of individuals to screen is small. They proposed an approximation to an optimal strategy that is difficult to implement for large population sizes. We develop an optimal design with respect to the expected total number of tests that can be obtained by using a novel dynamic programming algorithm. We show that this algorithm is substantially more efficient than the approach that was proposed by Black and co‐workers. In addition, we compare the two designs for imperfect tests. R code is provided for practitioners.

Suggested Citation

  • Yaakov Malinovsky & Gregory Haber & Paul S. Albert, 2020. "An optimal design for hierarchical generalized group testing," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(3), pages 607-621, June.
    • Handle: RePEc:bla:jorssc:v:69:y:2020:i:3:p:607-621
    DOI: 10.1111/rssc.12409
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/rssc.12409
    Download Restriction: no
    File URL: https://libkey.io/10.1111/rssc.12409?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. Michael S. Black & Christopher R. Bilder & Joshua M. Tebbs, 2015. "Optimal retesting configurations for hierarchical group testing," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 64(4), pages 693-710, August.
    2. Bilder, Christopher R. & Tebbs, Joshua M. & Chen, Peng, 2010. "Informative Retesting," Journal of the American Statistical Association, American Statistical Association, vol. 105(491), pages 942-955.
    3. D. V. Lindley, 1961. "Dynamic Programming and Decision Theory," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 10(1), pages 39-51, March.
    4. Yaakov Malinovsky & Paul S. Albert & Anindya Roy, 2016. "Reader reaction: A note on the evaluation of group testing algorithms in the presence of misclassification," Biometrics, The International Biometric Society, vol. 72(1), pages 299-302, March.
    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. Daniel K. Sewell, 2022. "Leveraging network structure to improve pooled testing efficiency," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1648-1662, November.

    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. Daniel K. Sewell, 2022. "Leveraging network structure to improve pooled testing efficiency," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1648-1662, November.
    2. Christopher R. Bilder & Joshua M. Tebbs & Christopher S. McMahan, 2019. "Informative group testing for multiplex assays," Biometrics, The International Biometric Society, vol. 75(1), pages 278-288, March.
    3. 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.
    4. Tom McGrath & Marc Schröder, 2025. "Competitive secretary problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-24, June.
    5. Fouad Ben Abdelaziz & Ray Saadaoui Mallek, 2018. "Multi-criteria optimal stopping methods applied to the portfolio optimisation problem," Annals of Operations Research, Springer, vol. 267(1), pages 29-46, August.
    6. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
    7. Fabien Gensbittel & Dana Pizarro & Jérôme Renault, 2024. "Competition and Recall in Selection Problems," Dynamic Games and Applications, Springer, vol. 14(4), pages 806-845, September.
    8. Sadoghi, Amirhossein & Vecer, Jan, 2022. "Optimal liquidation problem in illiquid markets," European Journal of Operational Research, Elsevier, vol. 296(3), pages 1050-1066.
    9. Amirhossein Sadoghi & Jan Vecer, 2022. "Optimal liquidation problem in illiquid markets," Post-Print hal-03696768, HAL.
    10. Christopher S. McMahan & Joshua M. Tebbs & Timothy E. Hanson & Christopher R. Bilder, 2017. "Bayesian regression for group testing data," Biometrics, The International Biometric Society, vol. 73(4), pages 1443-1452, December.
    11. Hsiao, Yu Chin & Kemp, Simon & Servátka, Maroš, 2019. "On the Importance of Context in Sequential Decision-Making," MPRA Paper 94027, University Library of Munich, Germany.
    12. Christopher S. McMahan & Joshua M. Tebbs & Christopher R. Bilder, 2012. "Informative Dorfman Screening," Biometrics, The International Biometric Society, vol. 68(1), pages 287-296, March.
    13. Ben Abdelaziz, F. & Krichen, S., 2005. "An interactive method for the optimal selection problem with two decision makers," European Journal of Operational Research, Elsevier, vol. 162(3), pages 602-609, May.
    14. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    15. L. Bayón & P. Fortuny & J. Grau & A. M. Oller-Marcén & M. M. Ruiz, 2019. "The Best-or-Worst and the Postdoc problems with random number of candidates," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 86-110, July.
    16. Adam Woryna, 2017. "The solution of a generalized secretary problem via analytic expressions," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1469-1491, May.
    17. Amnon Rapoport & Darryl A. Seale & Leonidas Spiliopoulos, 2023. "Progressive stopping heuristics that excel in individual and competitive sequential search," Theory and Decision, Springer, vol. 94(1), pages 135-165, January.
    18. Werner Guth & Torsten Weiland, 2011. "Aspiration formation and satisficing in search with(out) competition," New Zealand Economic Papers, Taylor & Francis Journals, vol. 45(1-2), pages 23-45.
    19. Jiayi Lin & Hrayer Aprahamian & George Golovko, 2024. "An optimization framework for large-scale screening under limited testing capacity with application to COVID-19," Health Care Management Science, Springer, vol. 27(2), pages 223-238, June.
    20. Wang, Dewei & McMahan, Christopher S. & Tebbs, Joshua M. & Bilder, Christopher R., 2018. "Group testing case identification with biomarker information," Computational Statistics & Data Analysis, Elsevier, vol. 122(C), pages 156-166.

    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:bla:jorssc:v:69:y:2020:i:3:p:607-621. 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://edirc.repec.org/data/rssssea.html .

    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.