Rule Designs for Optimal Online Game Matchmaking

TL;DR

This paper analyzes and designs optimal matchmaking rules for 2v2 online games to minimize waiting times, using queueing theory and exploring static and dynamic rule settings.

Contribution

It introduces a queueing theoretic framework for designing optimal matchmaking rules, including static and dynamic settings, to reduce player waiting times.

Findings

Derived closed-form expressions for expected waiting times.

Identified the value of choice-free players in matchmaking.

Provided guidelines for online game rule design.

Abstract

Online games are the most popular form of entertainment among youngsters as well as elders. Recognized as e-Sports, they may become an official part of the Olympic Games by 2020. However, a long waiting time for matchmaking will largely affect players' experiences. We examine different matchmaking mechanisms for 2v2 games. By casting the mechanisms into a queueing theoretic framework, we decompose the rule design process into a sequence of decision making problems, and derive the optimal mechanism with minimum expected waiting time. We further the result by exploring additional static as well as dynamic rule designs' impacts. In the static setting, we consider the game allows players to choose sides before the battle. In the dynamic setting, we consider the game offers multiple zones for players of different skill levels. In both settings, we examine the value of choice-free players. Closed form expressions for the expected waiting time in different settings illuminate the guidelines for online game rule designs.