TY - GEN
T1 - A lecture allocation method based on multi-leveled value model
AU - Saito, Yoshihito
AU - Matsuo, Tokuro
AU - Fujimoto, Takayuki
PY - 2009
Y1 - 2009
N2 - This paper describes the lecture allocation method and its support system for elective subjects. Students take a lecture for their career, for academical interest, and for assimilation of knowledge in a university. However, some students might take the lecture following the crowd and take the lecture as Mickey Mouse. To solve the problem, we propose a new multi-step lecture allocation method based on students' preferences and university intentions. Our protocol consists of the three steps of negotiations and three types of allocations. (1) The university warns the students who have never take a certain compulsory subject yet. If the students answer they attend the lecture, the students are allocated to the lecture by priority. (2) The students inform the university of their reasons to take the lecture. The university allocates the lectures to the students based on their reasons. (3) They negotiate about the exchange of lectures to increase students' utilities with each student. Our protocol realizes the high performance of allocation compared with brute force algorithm and reducing computational costs compared with optimizations.
AB - This paper describes the lecture allocation method and its support system for elective subjects. Students take a lecture for their career, for academical interest, and for assimilation of knowledge in a university. However, some students might take the lecture following the crowd and take the lecture as Mickey Mouse. To solve the problem, we propose a new multi-step lecture allocation method based on students' preferences and university intentions. Our protocol consists of the three steps of negotiations and three types of allocations. (1) The university warns the students who have never take a certain compulsory subject yet. If the students answer they attend the lecture, the students are allocated to the lecture by priority. (2) The students inform the university of their reasons to take the lecture. The university allocates the lectures to the students based on their reasons. (3) They negotiate about the exchange of lectures to increase students' utilities with each student. Our protocol realizes the high performance of allocation compared with brute force algorithm and reducing computational costs compared with optimizations.
KW - Allocation method
KW - Multi-agent systems
KW - Multi-attribute utility theory
KW - Multi-leveled determination
KW - Negotiations
UR - https://www.scopus.com/pages/publications/77949808388
UR - https://www.scopus.com/pages/publications/77949808388#tab=citedBy
U2 - 10.1109/SERA.2009.42
DO - 10.1109/SERA.2009.42
M3 - Conference contribution
AN - SCOPUS:77949808388
SN - 9780769539034
T3 - Proceedings - 7th ACIS International Conference on Software Engineering Research, Management and Applications, SERA09
SP - 3
EP - 9
BT - Proceedings - 7th ACIS International Conference on Software Engineering Research, Management and Applications, SERA09
T2 - 7th ACIS International Conference on Software Engineering Research, Management and Applications, SERA09
Y2 - 2 December 2009 through 4 December 2009
ER -