| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 101 === In a tournament, there are n players v_1, v_2, ..., v_n such that each pair of distinct players v_i and v_j is joined in only one game and no game is permitted to end in a tie. The score of v_i, denoted by s_i, is the total number of games that v_i wins. The score sequence of a tournament is a non-decreasing integer sequence S=(s_1, s_2, ..., s_n) with s_1 <= s_2 <=... <= s_n. We say that an upset occurs in a tournament if there are two players v_i and v_j with i<j such that v_i defeats v_j, i.e., a weak player beats a strong player in a game.
Given a score sequence, the objective of this thesis is to construct all tournaments with the minimum number of upsets.
|
|---|
