IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i6p2901-2924.html
   My bibliography  Save this article

From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs

Author

Listed:
  • Huan Zheng

    (Antai College of Economics and Management, Data-Driven Management Decision Making Laboratory, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Guodong Lyu

    (School of Business and Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong)

  • Jiannan Ke

    (School of Economics and Management, Wuhan University, Wuhan, Hubei 430072, China)

  • Chung-Piaw Teo

    (Institute of Operations Research and Analytics, National University of Singapore, Singapore 117602; NUS Business School, National University of Singapore, Singapore 119245)

Abstract

Problem definition : Cash transfer programs (CTPs) have spread in the last decade to help fight extreme poverty in different parts of the world. A key issue here is to ensure that the cash is distributed to the targeted beneficiaries in an appropriate manner to meet the goals of the programs. How do we design efficient and egalitarian allocation rules for these programs? Academic/practical relevance : Big data and machine learning have been used recently by several CTPs to target the right beneficiaries (those living in extreme poverty). We demonstrate how these targeting methods can be integrated into the cash allocation problem to synthesize the impact of targeting errors on the design of the allocation rules. In particular, when the targeting errors are “well calibrated,” a simple predictive allocation rule is already optimal. Finally, although we only focus on the problem of poverty reduction (efficiency), the optimality conditions ensure that these allocation rules provide a common ex ante service guarantee for each beneficiary in the allocation outcome (egalitarian). Methodology : We design allocation rules to minimize a key indicator in poverty reduction—the squared gap of the shortfall between the income/consumption and the poverty line. The rules differ in how the targeting error distribution is being utilized. Robust and online convex optimization are applied for the analysis. We also modify our allocation rules to ensure that the cash is spread more evenly across the pool of beneficiaries to reduce the (potential) negative effect on nonbeneficiary households living close to the poverty line but missing the benefits of the CTPs because of imperfect targeting. Results : Given a targeting method, we compare and contrast the performance of different allocation rules—predictive, stochastic, and robust. We derive closed-form solutions to predictive and stochastic allocation models and use robust allocation to mitigate the negative impact of imperfect targeting. Moreover, we show that the robust allocation decision can be efficiently computed using online convex optimization. Managerial implications : Using real data from a CTP in Malawi, we demonstrate how a suitable choice of allocation rule can improve both the efficiency and egalitarian objectives of the CTP. The technique can be suitably modified to ensure that the wealth distribution after allocation is “smoother,” reducing the bunching effect that may be undesirable in some circumstances.

Suggested Citation

  • Huan Zheng & Guodong Lyu & Jiannan Ke & Chung-Piaw Teo, 2022. "From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs," Manufacturing & Service Operations Management, INFORMS, vol. 24(6), pages 2901-2924, November.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:6:p:2901-2924
    DOI: 10.1287/msom.2022.1101
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.1101
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.1101?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
    ---><---

    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:inm:ormsom:v:24:y:2022:i:6:p:2901-2924. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.