| Summary: | 碩士 === 國立中央大學 === 資訊工程學系 === 101 === In Multiplayer Online Games, the definition of the term Matchmaking is a process that arranging players for online play sessions. Currently, Matchmaking arranging players together according to two types of criteria Connection Based and Skill Based. In Connection Based criterion, players with higher mutual network connection speed are arranged together. In Skill Based criterion, players with close value of Skill Rating are arranged together. In this paper, we propose a new criterion. Also, according to proposed criterion, we propose a new Matchmaking algorithm to arrange players together. Proposed new criterion called “Association Based”. In this criterion, players with higher Association to each others are arranged together. Proposed new Matchmaking algorithm called “LOM”(Leader-Oriented Matchmaking). It uses the concept of Minimum Cost Maximum Flow algorithm to arrange players in optimized way. It is worth mentioning that abovementioned two existing criteria, Connection Based and Skill Based, both of them can be substituted into LOM. And they are also able to acquire the optimized execution result with respect to their requirements. Besides, we did simulation to make comparisons between LOM, Greedy and Random. As for the result, the time complexity of Random is the lowest but it produces the worst average Association. The time complexity of Greedy is higher and it produces better average Association. Although the time complexity of LOM is highest, it produces the best average Association.
|
|---|
