从目标到转移:现金转移计划分配规则的设计

Huan Zheng, Guodong Lyu, Jiannan Ke, C. Teo
{"title":"从目标到转移:现金转移计划分配规则的设计","authors":"Huan Zheng, Guodong Lyu, Jiannan Ke, C. Teo","doi":"10.1287/msom.2022.1101","DOIUrl":null,"url":null,"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.","PeriodicalId":18108,"journal":{"name":"Manuf. Serv. Oper. Manag.","volume":"60 1","pages":"2901-2924"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs\",\"authors\":\"Huan Zheng, Guodong Lyu, Jiannan Ke, C. Teo\",\"doi\":\"10.1287/msom.2022.1101\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":18108,\"journal\":{\"name\":\"Manuf. Serv. Oper. Manag.\",\"volume\":\"60 1\",\"pages\":\"2901-2924\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manuf. Serv. Oper. Manag.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2022.1101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manuf. Serv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.1101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

问题定义:在过去十年中,现金转移支付计划(ctp)在世界各地得到推广,以帮助消除极端贫困。这里的一个关键问题是确保现金以适当的方式分配给目标受益人,以实现方案的目标。我们如何为这些项目设计高效和平等的分配规则?学术/实践相关性:大数据和机器学习最近被几个ctp用来瞄准正确的受益者(那些生活在极端贫困中的人)。我们演示了如何将这些目标方法集成到现金分配问题中,以综合目标错误对分配规则设计的影响。特别是,当目标错误被“很好地校准”时,一个简单的预测分配规则已经是最优的。最后,虽然我们只关注减贫问题(效率),但最优性条件确保这些分配规则在分配结果(平等主义)中为每个受益人提供共同的事前服务保障。方法:我们设计了分配规则,以最小化减少贫困的一个关键指标——收入/消费与贫困线之间的差距的平方。这些规则的不同之处在于如何利用目标误差分布。采用鲁棒在线凸优化方法进行分析。我们还修改了分配规则,以确保现金在受益人群体中更均匀地分配,以减少对生活在贫困线附近但由于目标不完善而错过ctp福利的非受益人家庭的(潜在)负面影响。结果:给定一个目标方法,我们比较和对比了不同分配规则的性能-预测性,随机性和鲁棒性。我们导出了预测和随机分配模型的封闭解,并使用鲁棒分配来减轻不完美目标的负面影响。此外,我们还证明了使用在线凸优化可以有效地计算鲁棒分配决策。管理意义:使用马拉维CTP的真实数据,我们展示了如何选择合适的分配规则可以提高CTP的效率和平等目标。可以对这种技术进行适当修改,以确保分配后的财富分配“更平滑”,减少在某些情况下可能不希望出现的聚集效应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信