A new knockout tournament seeding method and its axiomatic justification

Abstract A new set of axioms and new method (equal gap seeding) are designed. The equal gap seeding is the unique seeding that, under the deterministic domain assumption, satisfies the delayed confrontation, fairness, increasing competitive intensity and equal rank differences axioms. The equal gap seeding is the unique seeding that, under the linear domain assumption, maximizes the probability that the strongest participant is the winner, the strongest two participants are the finalists, the strongest four participants are the quarterfinalists, etc.

[2]  Samuel S. Wu,et al.  A Comparison of Potential Playoff Systems for NCAA I-A Football , 2006 .

[3]  J. C. Smith,et al.  Designing fair 8- and 16-team knockout tournaments , 2013 .

[4]  Mike Wright,et al.  OR analysis of sporting rules - A survey , 2014, Eur. J. Oper. Res..

[5]  É. Marchand.  On the comparison between standard and random knockout tournaments , 2002 .

[6]  U. Sunde,et al.  Incentives and Selection in Promotion Contests: Is It Possible to Kill Two Birds with One Stone? , 2015 .

[7]  Philip A. Scarf,et al.  A numerical study of tournament structure and seeding policy for the soccer World Cup Finals , 2011 .

[8]  R. Noll.  The Organization of Sports Leagues , 2003 .

[9]  Jeff Horen,et al.  Comparing Draws for Single Elimination Tournaments , 1985, Oper. Res..

[10]  Dmitry Dagaev,et al.  Seeding, Competitive Intensity and Quality in Knock-Out Tournaments , 2015 .

[11]  Matthias Kräkel,et al.  Optimal seedings in elimination tournaments revisited , 2014 .

[12]  T Mcgarry,et al.  Efficacy of traditional sport tournament structures , 1997 .

[13]  Toby Walsh,et al.  Fixing a Balanced Knockout Tournament , 2014, AAAI.

[14]  Yoav Shoham,et al.  Fair Seeding in Knockout Tournaments , 2011, TIST.

[15]  Mark E. Glickman,et al.  Bayesian locally optimal design of knockout tournaments , 2008 .

[16]  Herman Stekler,et al.  Are sports seedings good predictors?: an evaluation , 1999 .

[17]  A. Rubinstein,et al.  Choosing the two finalists , 2011 .

[18]  Douglas M. King,et al.  Seed distributions for the NCAA men’s basketball tournament , 2011 .

[19]  Yoav Shoham,et al.  On the complexity of schedule control problems for knockout tournaments , 2009, AAMAS.

[20]  Uwe Sunde,et al.  Optimal seedings in elimination tournaments , 2012 .

[21]  Virginia Vassilevska Williams.  Fixing a Tournament , 2010, AAAI.

[22]  Victor A. Matheson,et al.  Anomalies in Tournament Design: The Madness of March Madness , 2010 .

[23]  Frank K. Hwang,et al.  New Concepts in Seeding Knockout Tournaments , 1982 .

[24]  S. Jacobson,et al.  Modeling the winning seed distribution of the NCAA Division I men׳s basketball tournament ☆ , 2015 .

[25]  Allen J. Schwenk,et al.  What Is the Correct Way to Seed a Knockout Tournament? , 2000, Am. Math. Mon..

[26]  Levent Ülkü,et al.  Choosing two finalists and the winner , 2015, Soc. Choice Welf..