In spatial-model computer simulations with artificial voters and candidates, the well-known minimax single-winner voting system far outperformed 10 other systems at picking the best winners. It essentially tied with two others (Schulze and ranked pairs), both of which are far more complex than minimax. Minimax’s other advantages include Condorcet consistency, simplicity, monotonicity, and ease of voting because it allows tied and missing ranks. It also makes insincere strategic voting schemes difficult and dangerous for the schemers. The new minimax-TD system modifies minimax in three ways, all of which make it pick better winners, according to simulation studies: (a) TD includes Smith/minimax, (b) TD uses one particular definition of a candidate’s “largest loss” in two-way elections, and (c) TD includes a multi-stage tie-breaker which breaks nearly all ties. TD avoids four of the worst anomalies afflicting classic minimax. Four other minimax anomalies can be ignored, leaving TD arguably free of anomalies.

在对人工选民和候选人进行的空间模型计算机模拟中，著名的极小极大单获胜者投票系统在选出最佳获胜者方面的表现远远超过其他 10 个系统。它基本上与其他两个（Schulze 和排名对）相关，两者都比 minimax 复杂得多。Minimax 的其他优点包括 Condorcet 一致性、简单性、单调性和易于投票，因为它允许并列和缺失秩。这也使不真诚的战略投票计划对策划者来说变得困难和危险。根据模拟研究，新的 minimax-TD 系统以三种方式修改 minimax，所有这些都使其选择更好的赢家：(a) TD 包括 Smith/minimax，(b) TD 使用候选人“最大损失”的一个特定定义在双向选举中，(c) TD 包括一个多阶段决胜局，几乎可以打破所有平局。TD 避免了影响经典 minimax 的四个最严重的异常。可以忽略其他四个 minimax 异常，使 TD 可以说没有异常。