What is the typical number of rounds in a gladiatorial league with N gladiators?

  • Context: Graduate 
  • Thread starter Thread starter onomatomanic
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on determining the typical number of elimination rounds in a gladiatorial league with N gladiators, where each gladiator competes against n opponents immediately adjacent to their number. For instance, if n=2, gladiator #50 fights #48, #49, #51, and #52. The process continues until a champion emerges, but if no gladiator wins all their matches, no champion is declared. The conversation also touches on the implications of using a Markov chain to model the outcomes of these matches.

PREREQUISITES
  • Understanding of elimination tournament structures
  • Familiarity with Markov chains and probability theory
  • Basic knowledge of competitive match dynamics
  • Concept of incapacitation in combat sports
NEXT STEPS
  • Research elimination tournament formats and their mathematical implications
  • Study Markov chain applications in competitive scenarios
  • Explore probability estimations for match outcomes in sports
  • Investigate the dynamics of incapacitation versus death in combat sports
USEFUL FOR

This discussion is beneficial for mathematicians, game theorists, and sports analysts interested in modeling competitive elimination formats and understanding the dynamics of combat sports.

onomatomanic
Messages
103
Reaction score
1
Say there are N gladiators, and I want to find the champion among them. The method by which this is done is a series of elimination rounds, which are similar to but not quite like the methods used in many modern sports events:

Each gladiator is given a number from 1 to N. Each gladiator then fights the n gladiators with numbers immediately lower than their own and the n gladiators with numbers immediately higher than their own, where n is some constant much smaller than N. For example, if n=2, then gladiator #50 fights gladiators #49, #48, #51, and #52 in the first round.

Only those who win all of their fights advance to the next round, and the process repeats. To continue the example, assuming that our #50 won all four fights, then all of their opponents were necessarily eliminated because they lost at least one of their fights, namely the one with #50. So, in the second round, #50's closest possible opponents would be #47, #44, #53, and #56. Then again, it's possible that they are already the "last man standing", because nobody else managed to win all of their four fights.

I haven't decided what happens "at the edges", i.e. who #1 fights in the first round, other than #2 and #3, if anyone. For practical reasons, they can't fight #N-1 and #N, which would of course be the tidiest solution. Let's treat that point as negligible, for now.

It's easy to calculate how many rounds this championship will take at least - one, see above. It's almost as easy to calculate how many rounds it will take at most. However, how many rounds will it take typically, as a function of N and n?
 
Physics news on Phys.org
What happens if nobody wins all 4 his matches??
 
micromass said:
What happens if nobody wins all 4 his matches??

Doesn't sound like much of a Gladiator to me...
 
chiro said:
Doesn't sound like much of a Gladiator to me...

I thought the matches are to the death.

I am Spartacus!
 
SteveL27 said:
I thought the matches are to the death.

I am Spartacus!

 
Last edited by a moderator:
Anyway, I guess that this problem can be solved by making it in some kind of Markov chain. I'll try to find the solution if I'm bored.
 
One can only become The Champion if one is undefeated. Thus, if nobody whatsoever makes it to the second round, there is no champion. Baaad omen, presumably.

The weapons used are such that fights are typically to incapacitation rather than death, and killing one's opponent is frowned upon - as a sign of a lack of finesse, if nothing else. Accidental deaths aren't exactly infrequent occurrences either, though.

micromass, if you could just outline the approach, I can probably take it from there. Mainly, my problem is that I have no real handle on how to estimate the chances of someone winning all 2n of their fights in a given round if they are better, in some objective sense, than all of their opponents. Somewhere between 1 and (1/2)^(2n), obviously, but that's not much help.
 

Similar threads

Replies
21
Views
15K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
8K
Replies
7
Views
3K
Replies
3
Views
5K
  • · Replies 1 ·
Replies
1
Views
11K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 67 ·
3
Replies
67
Views
16K