IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i3p325-339.html
   My bibliography  Save this article

Optimal resource allocation to minimize errors when detecting human trafficking

Author

Listed:
  • Abhishek Ray
  • Viplove Arora
  • Kayse Maass
  • Mario Ventresca

Abstract

Accurately detecting human trafficking is particularly challenging due to its covert nature, difficulty in distinguishing trafficking from non-trafficking exploitative conditions, and varying operational definitions. Typically, detecting human trafficking requires resource-intensive efforts from resource-constrained anti-trafficking stakeholders. Such measures may need personnel training or machine learning-based identification technologies that suffer from detection errors. Repeated usage of such measures risks biasing detection efforts and reducing detection effectiveness. Such problems raise the question: “How should imperfect detection resources be allocated to most effectively identify human trafficking?” As an answer, we construct a class of resource allocation models that considers various optimal allocation scenarios. These scenarios range from optimal location selection for monitoring to optimal allocation of a finite set of imperfect resources, given error rates. We illustrate the applicability of these models across both human and technology-facilitated detection contexts at the India–Nepal border and in the global seafood industry. Insights from our models help inform operational strategies for allocating limited anti-human trafficking resources in a way that effectively preserves human rights and dignity.

Suggested Citation

  • Abhishek Ray & Viplove Arora & Kayse Maass & Mario Ventresca, 2024. "Optimal resource allocation to minimize errors when detecting human trafficking," IISE Transactions, Taylor & Francis Journals, vol. 56(3), pages 325-339, March.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:3:p:325-339
    DOI: 10.1080/24725854.2023.2177364
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2177364
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2177364?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.

    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:taf:uiiexx:v:56:y:2024:i:3:p:325-339. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.