The Improvements and Extensions of Automatic Ranking Algorithms

• Main Authors: Wei-Liang Shia, 夏維良
• Other Authors: Kun-Mao Chao
• Format: Others
• Language: en_US
• Published: 2019
• Online Access: http://ndltd.ncl.edu.tw/handle/bx3ds5

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 107 === We introduce some variants of Chain Editing problem. In our version of Chain Editing, we are given a set of participants and a set of questions. If a participant answer a question correctly, we add a edge between the participant and the question. Therefore we can distinguish the participants’ ability to solve questions by the degrees of nodes. These nodes stand for the participants. In an ideal world, a stronger participant answers correctly a superset of questions that a weaker participant answers correctly. Similarly, a easier question should be answered correctly by a superset of participants who answers a more difficult question correctly. In reality, it may happen that a stronger have given a wrong answer for a easier question. We assume that some questions are not suitable for the contest. Therefore our goal is to find a perfect nesting of the participant-question relations by deleting a minimum number of questions. In addition, we introduce a variant of the Chain Editing problem for the situation that participants can forms teams for the ranking. Finally, we design an algorithm to get the nearest ideal list of points of a participant when participants can get partial points from each questions.