STRUCTURED DISCRETE FAIR DIVISION ALGORITHM FOR ALLOCATING SUBTASKS WITHIN STUDENT PROJECTS
Date Issued
2020-07
Author(s)
Simjanoska, Monika
Madevska Bogdanova, Ana
Abstract
We are investigating the most appropriate allocation of subtasks within students projects which are compulsory part of the Intelligent Systems course taught at the Faculty of Computer Science and Engineering in Skopje, N. Macedonia. The past experience has shown that the students tend to
choose the subtasks they find to be the easiest. To avoid the “easiest route” approach, we propose a fair division strategy for solving this problem. The main goal is to guarantee the success and high
quality of the student projects. To achieve the aims, our methodology is focused on objective
determination of the students’ preferences for each project subtask and map them in the most
appropriate one. The results have shown that our approach ensures efficiency and envy-freeness,
whereas the equitability is partially proved due to the subjective student’s evaluation of the personal preferences as a result of the biasness to the teachers valuation of the subtasks.
choose the subtasks they find to be the easiest. To avoid the “easiest route” approach, we propose a fair division strategy for solving this problem. The main goal is to guarantee the success and high
quality of the student projects. To achieve the aims, our methodology is focused on objective
determination of the students’ preferences for each project subtask and map them in the most
appropriate one. The results have shown that our approach ensures efficiency and envy-freeness,
whereas the equitability is partially proved due to the subjective student’s evaluation of the personal preferences as a result of the biasness to the teachers valuation of the subtasks.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
EduLearn_official_2020597.pdf
Size
254.86 KB
Format
Adobe PDF
Checksum
(MD5):6e5456b0f348a01defa402374bff99c9