GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Informa UK Limited ; 2022
    In:  Journal of the American Statistical Association Vol. 117, No. 539 ( 2022-07-03), p. 1338-1356
    In: Journal of the American Statistical Association, Informa UK Limited, Vol. 117, No. 539 ( 2022-07-03), p. 1338-1356
    Type of Medium: Online Resource
    ISSN: 0162-1459 , 1537-274X
    RVK:
    RVK:
    Language: English
    Publisher: Informa UK Limited
    Publication Date: 2022
    detail.hit.zdb_id: 2064981-2
    detail.hit.zdb_id: 207602-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2022
    In:  Manufacturing & Service Operations Management Vol. 24, No. 6 ( 2022-11), p. 2901-2924
    In: Manufacturing & Service Operations Management, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 24, No. 6 ( 2022-11), p. 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. History: This paper has been accepted for the Manufacturing & Service Operations Management Special Section on Responsible Research in Operations Management. Funding: H. Zheng is supported by the National Natural Science Foundation of China [Grant 71871139]. G. Lyu and C.-P. Teo are supported by the 2019 Academic Research Fund Tier 3, the Ministry of Education, Singapore [Grant MOE-2019-T3-1-010] . J. Ke is supported by the National Natural Science Foundation of China [Grant 72101191]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1101 .
    Type of Medium: Online Resource
    ISSN: 1523-4614 , 1526-5498
    RVK:
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2022
    detail.hit.zdb_id: 2023273-1
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2019
    In:  Management Science Vol. 65, No. 11 ( 2019-11), p. 5091-5109
    In: Management Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 65, No. 11 ( 2019-11), p. 5091-5109
    Abstract: In many production environments, a fixed network of capacity is shared flexibly between multiple products with random demands. What is the best way to configure the capacity of the production network and to allocate the available capacity to meet predetermined fill rate requirements? We develop a new approach for network capacity configuration and allocation and characterize the relationship between the capacity of the network and the attainable fill rate levels for the products, taking into account the flexibility structure of the network. This builds on a new randomized allocation mechanism to deliver the desired services. We use this theory to investigate the connection between the flexibility structure and capacity configuration. We provide a new perspective to the well-known phenomenon that “long chain is almost as good as the fully flexible network”: for given target fill rates, the required capacity level in a long-chain network is close to that in a fully flexible network and is much lower than a dedicated system. We apply these insights and techniques on problems arising in the design of last-mile delivery operations and in semiconductor production planning, using real data from two companies. This paper was accepted by Terry Taylor, operations management.
    Type of Medium: Online Resource
    ISSN: 0025-1909 , 1526-5501
    RVK:
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2019
    detail.hit.zdb_id: 206345-1
    detail.hit.zdb_id: 2023019-9
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2018
    In:  Biometrika Vol. 105, No. 1 ( 2018-03-01), p. 73-89
    In: Biometrika, Oxford University Press (OUP), Vol. 105, No. 1 ( 2018-03-01), p. 73-89
    Type of Medium: Online Resource
    ISSN: 0006-3444 , 1464-3510
    RVK:
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2018
    detail.hit.zdb_id: 1119-8
    detail.hit.zdb_id: 1470319-1
    SSG: 12
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...