Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/80036
PIRA download icon_1.1View/Download Full Text
Title: An incentive dynamic programming method for the optimization of scholarship assignment
Authors: Huang, D
Gu, Y
Wang H 
Liu, Z
Chen, J
Issue Date: 2018
Source: Discrete dynamics in nature and society, 2018, v. 2018, 5206131, p. 1-7
Abstract: Scholarship assignment is an operations management problem confronting university administrators, which is traditionally solved based on administrators' personal experiences. This paper proposes an incentive method inspired by dynamic programming to replace the traditional decision-making process in the scholarship assignment. The objective is to find the optimal scholarship assignment scheme with the highest equity while accounting for both the practical constraints and the equity requirement. Moreover, with the proposed method, the scholarship assignment avoids time- and energy-consuming application processes conducted by students. A solution algorithm is used to find feasible assignment schemes by iteratively solving a series of knapsack subproblems based on dynamic programming and adjusting the monetary value of a unit score. The optimal assignment scheme can then be screened out by applying the Gini coefficient for quantifying the equity of each feasible scheme. A numerical case is investigated to illustrate the applicability of the proposed method and solution algorithm. The results indicate that the proposed method is an efficient tool to assign scholarships to students with consideration of the equity.
Publisher: Hindawi Publishing Corporation
Journal: Discrete dynamics in nature and society 
ISSN: 1026-0226
EISSN: 1607-887X
DOI: 10.1155/2018/5206131
Rights: Copyright © 2018 DiHuang et al. This is an open access article distributed under the Creative CommonsAttribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The following publication Huang, D., Gu, Y., Wang, H., Liu, Z. & Chen, J. (2018). An incentive dynamic programming method for the optimization of scholarship assignment. Discrete Dynamics in Nature and Society, 2018, 5206131, 1-7 is available at https://dx.doi.org/10.1155/2018/5206131
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Huang_Incentive_Dynamic_Programming.pdf1.41 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

106
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

91
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.