Da Void of Meaning

Thursday, July 8, 2021

Huber Round Robin Problem

 With n teams of equal ability and one team that can beat the others with probability p > 1/2 how many teams are needed to assure the best team wins a round robin tournament in which each team plays all other teams once? Some details here.

Posted by Roger Koenker at 6:54 AM No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Blog Archive

  • ►  2024 (3)
    • ►  September (1)
    • ►  June (1)
    • ►  March (1)
  • ►  2023 (3)
    • ►  December (1)
    • ►  September (1)
    • ►  July (1)
  • ►  2022 (3)
    • ►  December (1)
    • ►  August (1)
    • ►  May (1)
  • ▼  2021 (11)
    • ►  November (2)
    • ►  September (2)
    • ►  August (1)
    • ▼  July (1)
      • Huber Round Robin Problem
    • ►  June (1)
    • ►  May (1)
    • ►  April (2)
    • ►  January (1)
  • ►  2020 (7)
    • ►  December (1)
    • ►  September (1)
    • ►  June (1)
    • ►  May (1)
    • ►  April (3)
  • ►  2019 (3)
    • ►  December (1)
    • ►  October (1)
    • ►  May (1)
  • ►  2017 (3)
    • ►  August (2)
    • ►  July (1)
  • ►  2016 (9)
    • ►  December (1)
    • ►  November (2)
    • ►  September (2)
    • ►  March (3)
    • ►  January (1)
  • ►  2015 (7)
    • ►  December (1)
    • ►  November (2)
    • ►  October (1)
    • ►  April (1)
    • ►  March (2)
  • ►  2014 (5)
    • ►  March (1)
    • ►  February (2)
    • ►  January (2)
  • ►  2013 (5)
    • ►  September (1)
    • ►  August (1)
    • ►  June (1)
    • ►  May (2)

About Me

Roger Koenker
View my complete profile
Simple theme. Powered by Blogger.