EconPapers    
Economics at your fingertips  
 

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

Huan Zheng (), Guodong Lyu (), Jiannan Ke () and Chung-Piaw Teo ()
Additional contact information
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

Manufacturing & Service Operations Management, 2022, vol. 24, issue 6, 2901-2924

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.

Keywords: humanitarian assistance; cash transfer program; imperfect targeting (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/msom.2022.1101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormsom:v:24:y:2022:i:6:p:2901-2924

Access Statistics for this article

More articles in Manufacturing & Service Operations Management from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ormsom:v:24:y:2022:i:6:p:2901-2924