We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no ties allowed). A map is a set of tournaments represented as points on a 2D plane, so that their Euclidean distances resemble the distances computed according to a given measure. We identify useful distance measures, discuss ways of generating random tournaments (and compare them to several real-life ones), and show how the maps are helpful in visualizing experimental results (also for knockout tournaments).

翻译：我们通过借鉴选举领域的映射框架构建了一个“锦标赛地图”。锦标赛在此指一个完全有向图，其节点代表参赛者，每条边从比赛的胜者指向负者（不允许平局）。该地图将一组锦标赛表示为二维平面上的点，使得这些点之间的欧几里得距离能够近似反映依据特定度量计算得到的距离。我们识别了有效的距离度量方法，探讨了随机锦标赛的生成方式（并与若干现实赛事进行比较），并展示了此类地图如何有助于实验结果的可视化呈现（亦适用于淘汰制锦标赛）。