{"title":"A Lecture Allocation Method Based on Multi-Leveled Value Model","authors":"Yoshihito Saito, T. Matsuo, T. Fujimoto","doi":"10.1109/SERA.2009.42","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":333607,"journal":{"name":"2009 Seventh ACIS International Conference on Software Engineering Research, Management and Applications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Seventh ACIS International Conference on Software Engineering Research, Management and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERA.2009.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.