computerrank wrote:conan,
you compare apples with oranges here.
Boxrec algorithm and ELO algorithm have the same base - this definitely is not the difference.
The basic difference is in
- the number of players in the chess world - hundreds of thousends or millions of active chess playera - versa about some thousends boxers
- the much higher rate of competition - chess players with hundreds of matches versa boxers with often only a handfull of bouts maybe once or twice a year
So the boxing ratings are faced with much fewer events to relax to some valid estimation, and represent a much lower density of skills.
So a win may cross over all limits in boxing seen from the boxing perspective - which in chess never will happpen.
The real requirement in boxing is to give a valid rating estimation based on a very small statistical base.
Speaking technically, in chess the space between the launching area and the top of the game is about 1400 points I think and the K-Factor is down to 30 or 15 (slow relaxation). This is a span of 100.
In boxing we are forced to use much faster relaxation - see our earnings of about 90 points (compare with a K-Factor of 180). and the space between the best and the launching area is about 500 to 800 points only. This is a span of 3.
So there is no space for moaning - we have to find the best solution - I should appreciate constructive suggestions, please.
Pure acclamations are not really helpful, sorry.
Best regards
Martin
Jeez, how much input do I have to give? Suggesting algorithms, measurements, checking trails, suggesting improvements.
Besides I consider the arguments expressed by the other poster and myself to be elementary to the problem. There's the old quote, "the first step in solving a problem is recognising that there is a problem".
Honestly Martin, I dont know if you really follow boxing, enjoy watching it, take an interest in who's winning and who's losing? I haven't seen you post anywhere on any Current Scene thread, except if it's an answer to a ratings question. If you do have any interest in boxing then can you truthfully answer the following question.
"Does the winner of a theoretical Shannon Briggs vs Brian Minto match up deserve to be the number one in the heavweight division, die Königsklasse von Boxen?".
Can you really answer that with yes. Not if you really are a boxing fan.
As to the apples and oranges comparison. It is you, not I, that are comparing apples and oranges. Golf, Tennis, Cricket, Chess all have rankings systems that are tailored to their domain. You are the one that has taken the solution for the chess domain (apples) and forced it on the boxing domain (oranges). You do this despite fully knowing that the number of matchups is not frequent enough in boxing to properly justify it. Chess players play 30 bouts or more a year, boxers 30 in a career. Clearly you have to make adjustments for this.
The launching part is an excellent start of a domain specific solution. The concept is the same as in other algorithms, but the solution is domain specific.
The real requirement in boxing is to give a valid rating estimation based on a very small statistical base.
If that is truly the real requirement, then again it is the argument what is meant by valid. I say "accepted by peers and supported by predictability", you say "predictability", with of course, all the known side effects.
It may be painful to hear it over and over again, but hey, answer the question above as a boxing fan, and you'll see why the questions will be repeated.
conan