Roger de Coverly wrote:David Smerdon (Aussie GM) has a blog in which he describes how he used economic theory to develop an approach to chess tie breaks as part of the work required for his current course of study.
http://www.davidsmerdon.com/?p=944
An alternative and parallel method would be to use the recursion method or equivalent to compute ratings for all the players in a tournament using
only the tournament results as the input. You then separate ties by which players had the higher relative performance. It has to be done on a computer naturally and only makes sense when you have a monster Swiss of multiple rounds.
Smerdon's tie break method is designed to punish all draws by not counting them at all in the tie break score. The only way draws contribute, is being included in the total score, but it has no effect for tie break score. As such it doesn't matter if you draw or lose, there is no bonus for that whatsoever. Instead you get a bonus for each win, and a bonus for each indirect win, for instance if you win against a player and he wins against 3 players, you get 1 point for the direct win and 3 points for the indirect wins. The 3 points for indirect wins could be downsized with a constant, but I doubt that will improve the tie break to actually be as predictive as Buchholz and others.
Of course if you agree that we need to discourage any draw (like the football system) then this system makes some sense. It will obviously be biased against players like Anand that makes many draws and win few games. If that is fair then the Smerdon tie break could be considered as fair. However, I don't like this bias towards draws alltogether. Grandmaster draws is something to eradicate (I favor Sofia rules), but a draw is a natural outcome from a hard-fought game, and those I don't want to punish.
The problem here is that there is so many opinions about what is the fairest kind of tie break. It seems that each person has a different opinion.
I have been involved in discussions on the Australian ChessChat arbiter sub-forum about trying to measure the performance of a given tie break scientifically. Kevin Bonham came up with the amazingly simple idea that we could use already existing tournaments, and pretend the last round(s) wasn't played. The tie break score is calculated at round n-1 (n rounds in tourney) or n-2 or n-3, and then check if the tie score actually predicts who advances more in the last round(s). For example player A and B are tied on 6 points after 8 rounds. The tie break is calculated for each player. If player A and player B scores the same in the last round(s) then the result is not considered for the statistics of the tie break method, but if one of the players is ahead of the other in points, then it is checked whether that corresponds with that player having the highest tie break before the round(s). Then all players with equal points before the round(s) are compared to each other, and when there is a difference in score after last round, the result is included in the statistics.
This simple approach has given some surprising results compared to the current bias on tie break methods. For instance the official FIDE pages on tie breaks mention a lot of semi-dubious methods, but doesn't even mention Progressive (also called Cumulative). In the discussions before measuring tie break predictiveness, we all had some bias against Progressive, yet this turns out to be one of the most predictive tie breaks. In my opinion predictiveness is the best measurement of fairness, and in the end what we want is the fairest tie breaks possible. Punishing certain results is simply leading to worse predictiveness. For instance the Smerdon tie break is in some tournaments much worse than Buchholz or Progressive or even Berger (which actually performs surprisingly well in Swiss tournaments even if it is currently used much more in Round Robin). It is also noteworthy that Buchholz Cut 1 (throwing out 1 result) or Median Buchholz (throwing out 2 results), far from being fairer is simply lowering the predictiveness compared to full Buchholz.
Whether predictiveness is actually the only means to measure fairness, is of course a philosophical question.
I have made a program to measure tie break methods but I am missing one suggested tie break, what you mention, a tournament performance for each player without using anything else than the games in the tournament, and not considering the players current Elo. Do you have an idea how that could be calculated? I am willing to include it in my program if we can find a suitable formula. Your last comment that it only makes sense in a monster Swiss to use this tie break, seems unfounded to me. Why would it not work in small tournaments?