An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">ID</td><td class="align_center">Score</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">1</td><td class="align_center">25</td></tr><tr><td class="align_left">2</td><td class="align_center">20</td></tr><tr><td class="align_left">3</td><td class="align_center">30</td></tr><tr><td class="align_left">4</td><td class="align_center">35</td></tr><tr><td class="align_left">5</td><td class="align_center">15</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Discrete Dynamics in Nature and Society

tab2

Table 2

Table 2: An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment 