IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v102y2025ics0038012125001454.html
   My bibliography  Save this article

Improving scholarship assignment using approximate dynamic programming: A Chilean case study

Author

Listed:
  • Redondo, Sofía
  • Cataldo, Alejandro
  • Marquinez, José Tomás
  • Rey, Pablo A.
  • Sauré, Antoine

Abstract

A solution approach is proposed for a problem of assigning scholarships under budget constraints and uncertainty regarding the duration of previously awarded scholarships as determined by future renewals. The problem objective is to maximize the sum of the scores of accepted applicants subject to two conditions: (1) no applicant can be assigned a scholarship until assignments have been made to all applicants with higher scores; and (2) the annual budget allocation must first cover all renewals of previous awards. The approach is built around the formulation and approximate solution of a Markov decision process that provides a systematic method for identifying scholarship assignment policies which make efficient use of the annual scholarship budget. The benefits of the approach are analysed in a case study involving a scholarship offered annually in Chile that compares via simulation the solutions generated by various alternative assignment procedures with those of the proposed model. The results suggest that under the latter, 7% to 9% more students would be awarded scholarships each year without increasing the yearly budget.

Suggested Citation

  • Redondo, Sofía & Cataldo, Alejandro & Marquinez, José Tomás & Rey, Pablo A. & Sauré, Antoine, 2025. "Improving scholarship assignment using approximate dynamic programming: A Chilean case study," Socio-Economic Planning Sciences, Elsevier, vol. 102(C).
    • Handle: RePEc:eee:soceps:v:102:y:2025:i:c:s0038012125001454
    DOI: 10.1016/j.seps.2025.102296
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012125001454
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2025.102296?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:eee:soceps:v:102:y:2025:i:c:s0038012125001454. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    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.