About this paper

Appears in:
Pages: 1865-1872
Publication year: 2020
ISBN: 978-84-09-17979-4
ISSN: 2340-1117
doi: 10.21125/edulearn.2020.0597

Conference name: 12th International Conference on Education and New Learning Technologies
Dates: 6-7 July, 2020
Location: Online Conference

STRUCTURED DISCRETE FAIR DIVISION ALGORITHM FOR ALLOCATING SUBTASKS WITHIN STUDENT PROJECTS

A. Madevska Bogdanova, M. Simjanoska

University Sts Cyril and Methodius, Faculty of Computer Science and Engineering (MACEDONIA)
The fair division and collective well-fare have been subjects of discussion since the beginning of the civil society. The first notes of formalizing the definition of distributive fairness was given by Aristotle - two persons having the same characteristics regarding a given allocation problem, should be treated equally.

This research is about discrete subtasks fair division within student projects, a problem that cannot be solved by a standard cake-cutting approach, but nevertheless must fulfill the general features of fair division as envy-freeness, equity and Pareto optimality. Opposite of the general cake-cutting strategy where the agents involved aim to satisfy the appetite by maximizing the portion assigned, in our case we deal with agents (students) that have the affinity either to minimize the work or to delegate it to the other members of the team.

The project tasks can be divided in finite number of homogeneous subtasks. However, the problem gets more complicated by the fact that the teams are comprised of students with different course performance background. Allowing the students to choose subtasks by their own preferences is very likely to end up with insincere choice that is not consistent with their true preferences (skills).

We are investigating the most appropriate allocation of subtasks within student’s projects which are compulsory part of the Intelligent Systems course taught at the Faculty of Computer Science and Engineering in Skopje, North 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.
@InProceedings{MADEVSKABOGDANOVA2020STR,
author = {Madevska Bogdanova, A. and Simjanoska, M.},
title = {STRUCTURED DISCRETE FAIR DIVISION ALGORITHM FOR ALLOCATING SUBTASKS WITHIN STUDENT PROJECTS},
series = {12th International Conference on Education and New Learning Technologies},
booktitle = {EDULEARN20 Proceedings},
isbn = {978-84-09-17979-4},
issn = {2340-1117},
doi = {10.21125/edulearn.2020.0597},
url = {http://dx.doi.org/10.21125/edulearn.2020.0597},
publisher = {IATED},
location = {Online Conference},
month = {6-7 July, 2020},
year = {2020},
pages = {1865-1872}}
TY - CONF
AU - A. Madevska Bogdanova AU - M. Simjanoska
TI - STRUCTURED DISCRETE FAIR DIVISION ALGORITHM FOR ALLOCATING SUBTASKS WITHIN STUDENT PROJECTS
SN - 978-84-09-17979-4/2340-1117
DO - 10.21125/edulearn.2020.0597
PY - 2020
Y1 - 6-7 July, 2020
CI - Online Conference
JO - 12th International Conference on Education and New Learning Technologies
JA - EDULEARN20 Proceedings
SP - 1865
EP - 1872
ER -
A. Madevska Bogdanova, M. Simjanoska (2020) STRUCTURED DISCRETE FAIR DIVISION ALGORITHM FOR ALLOCATING SUBTASKS WITHIN STUDENT PROJECTS, EDULEARN20 Proceedings, pp. 1865-1872.
User:
Pass: