One could see it as ironic that experts in voting can't manage to agree on the best voting method. Then laugh and put the topic down.
But, we know that no voting method can force a majority if there is non in the electorate. The same is true for a Condorcet winner or finding a consensus. And going one step further back, maybe there isn't a single answer to that question.
I yesterday started to write two articles about the question, what makes a good voting system? Two articles because I arrived two answers.
The first one very practical.
Let's look at some obvious desirable criteria: satisfaction, fairness and simplicity (Jameson Quinn already wrote about that somewhere). In theory (if we had enough information) we could plot all voting systems on a three dimensional graph. But then the question is, which is the "best"? One might be very fair (resistant to strategy), but give medium satisfaction and is medium complex (e.g. MJ). While another gives good satisfaction and is simple, but easy to manipulate (e.g. score).
Instead of looking for the best one we could exclude every system which is worse than another in all three categories. This leaves us with a pareto front of several voting systems that are reasonably good.
Without having enough data, I guess this could look something like this (from simple to more complex):
approval, score, STAR or 3-2-1, Smith//score, Woodall's or Benhams' method
The second argument is more philosophical.
Since we know that no deterministic voting method can be strategy free we can ask our selves: How do we deal with strategy? While trying to map which voter strategies are possible I came to the conclusion that most fall in one of three categories: Dishonest preferences (favorite betrayal), Chicken Dilemma and Exaggeration.
The last of these is pretty much unavoidable. The other two can be avoided and I think it's important we do. The both represent a failure to cooperate. In terms of game theory, the first as prisoners dilemma, the second as the game of chicken. Failing to cooperate isn't only some obscure quirk in the niche science of voting theory, but actively harmful to society. If we could fully fix this, then this would be a huge advancement to humanity.
So I think, the voting reform movement currently tries to fix the spoiler effect and somewhat improve the selection of the winner. But when we have achieved this and the whole world is using some Condorcet or score method, then we will find that FB and CD are real problems we have to deal with. That this isn't utopia yet.
Finding methods that avoid both problems is hard, because solving CD in a strong sense implies having FB. It is however possible to solve CD in a weak sense.
These method, as far as I can see, achieve this:
ICT, MAV, MCA (some variants), MMPO, SIV
(The next step would be to filter out those that are subject to clones.)
As a bonus argument, one could say that we can avoid strategy altogether with non-deterministic methods. They also are more "fair" in the sense that they give every voter an equal chance of being heard. Therefor the best methods would be:
random ballot, random pair
Now with these arguments alone there are over a dozen methods that could qualify as "best", depending on the definition. So maybe there isn't really an answer to that question and which methods would be wise to use, depends very much on the situation.