IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v35y2005i6p497-510.html
   My bibliography  Save this article

Ranking Sports Teams: A Customizable Quadratic Assignment Approach

Author

Listed:
  • C. Richard Cassady

    (Department of Industrial Engineering, University of Arkansas, 4207 Bell Engineering Center, Fayetteville, Arkansas 72701)

  • Lisa M. Maillart

    (Department of Operations, Case Western Reserve University, 10900 Euclid Avenue, Cleveland, Ohio 44106)

  • Sinan Salman

    (Department of Industrial Engineering, University of Arkansas, 4207 Bell Engineering Center, Fayetteville, Arkansas 72701)

Abstract

Ranking sports teams in the absence of full round-robin tournaments is big business, especially for NCAA Division I-A college football. The Bowl Championship Series awards millions of dollars each year to the conferences whose teams are awarded bids. We formulated the sports-team-ranking problem as a customizable quadratic-assignment problem. Decision makers can tailor our model to suit their personal definitions of the degree of victory for each game played and the relative distance between ranking positions. We developed a parameter-section procedure for determining these customized values and executed it using the 2004 college football season. Because the problem size is so large, we developed a heuristic solution procedure based on a genetic algorithm and local search techniques. This heuristic performs well on a special problem instance in which we can easily identify the optimal ranking. To examine the behavior of our approach, we implemented the heuristic for the 1999 through 2004 college football seasons. We concluded that our approach works best when the margin of victory of individual games is not considered, the location of games is considered, and the date of games is considered. Finally, we evaluated how our approach would have weighed in on several recent controversies in NCAA Division I-A college football and found that our approach generally agrees with traditional schools of thought regarding these controversies.

Suggested Citation

  • C. Richard Cassady & Lisa M. Maillart & Sinan Salman, 2005. "Ranking Sports Teams: A Customizable Quadratic Assignment Approach," Interfaces, INFORMS, vol. 35(6), pages 497-510, December.
  • Handle: RePEc:inm:orinte:v:35:y:2005:i:6:p:497-510
    DOI: 10.1287/inte.1050.0171
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1050.0171
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1050.0171?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Rick L. Wilson, 1995. "Ranking College Football Teams: A Neural Network Approach," Interfaces, INFORMS, vol. 25(4), pages 44-59, August.
    2. Joseph Martinich, 2002. "College Football Rankings: Do the Computers Know Best?," Interfaces, INFORMS, vol. 32(5), pages 85-94, October.
    3. Michael Stob, 1985. "Note---Rankings from Round-Robin Tournaments," Management Science, INFORMS, vol. 31(9), pages 1191-1195, September.
    4. Stephen T. Goddard, 1983. "Ranking in Tournaments and Group Decisionmaking," Management Science, INFORMS, vol. 29(12), pages 1384-1392, December.
    5. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    6. Iqbal Ali & Wade D. Cook & Moshe Kress, 1986. "On the Minimum Violations Ranking of a Tournament," Management Science, INFORMS, vol. 32(6), pages 660-672, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tino Werner, 2022. "Elicitability of Instance and Object Ranking," Decision Analysis, INFORMS, vol. 19(2), pages 123-140, June.
    2. Brian McClure & Richard Cassady & Chase Rainwater & Justin R. Chimka, 2012. "Optimizing the Sunday Singles Lineup for a Ryder Cup Captain," Interfaces, INFORMS, vol. 42(2), pages 180-190, April.
    3. G Kendall, 2008. "Scheduling English football fixtures over holiday periods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 743-755, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. B. Jay Coleman, 2005. "Minimizing Game Score Violations in College Football Rankings," Interfaces, INFORMS, vol. 35(6), pages 483-496, December.
    2. Brozos-Vázquez, Miguel & Campo-Cabana, Marco Antonio & Díaz-Ramos, José Carlos & González-Díaz, Julio, 2008. "Ranking participants in tournaments by means of rating functions," Journal of Mathematical Economics, Elsevier, vol. 44(11), pages 1246-1256, December.
    3. Mass A. & Bezembinder, T. & Wakker, P., 1996. "On solving intansitivities in repeated pairwise choices," Mathematical Social Sciences, Elsevier, vol. 31(1), pages 53-53, February.
    4. Zhang, L.P. & Zhou, P., 2018. "A non-compensatory composite indicator approach to assessing low-carbon performance," European Journal of Operational Research, Elsevier, vol. 270(1), pages 352-361.
    5. Dong, Zhi-Long & Ribeiro, Celso C. & Xu, Fengmin & Zamora, Ailec & Ma, Yujie & Jing, Kui, 2023. "Dynamic scheduling of e-sports tournaments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    6. Siraj, Sajid & Mikhailov, Ludmil & Keane, John, 2012. "A heuristic method to rectify intransitive judgments in pairwise comparison matrices," European Journal of Operational Research, Elsevier, vol. 216(2), pages 420-428.
    7. Cook, Wade D., 2006. "Distance-based and ad hoc consensus models in ordinal preference ranking," European Journal of Operational Research, Elsevier, vol. 172(2), pages 369-385, July.
    8. Oliver G. Czibula & Hanyu Gu & Yakov Zinder, 2018. "Planning personnel retraining: column generation heuristics," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 896-915, October.
    9. Koning, Ruud H. & Koolhaas, Michael & Renes, Gusta & Ridder, Geert, 2003. "A simulation model for football championships," European Journal of Operational Research, Elsevier, vol. 148(2), pages 268-276, July.
    10. Young William A & Holland William S & Weckman Gary R, 2008. "Determining Hall of Fame Status for Major League Baseball Using an Artificial Neural Network," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 4(4), pages 1-46, October.
    11. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    12. Jean-François Cordeau & Manlio Gaudioso & Gilbert Laporte & Luigi Moccia, 2006. "A Memetic Heuristic for the Generalized Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 433-443, November.
    13. Funk, Patrick & Davis, Alex & Vaishnav, Parth & Dewitt, Barry & Fuchs, Erica, 2020. "Individual inconsistency and aggregate rationality: Overcoming inconsistencies in expert judgment at the technical frontier," Technological Forecasting and Social Change, Elsevier, vol. 155(C).
    14. Ngwenyama, Ojelanki K. & Bryson, Noel, 1999. "Eliciting and mapping qualitative preferences to numeric rankings in group decision making," European Journal of Operational Research, Elsevier, vol. 116(3), pages 487-497, August.
    15. Jarrod Olson & Daniel F. Stone, 2014. "Suspense-Optimal College Football Play-Offs," Journal of Sports Economics, , vol. 15(5), pages 519-540, October.
    16. Paul, G., 2011. "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 209(3), pages 215-218, March.
    17. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    18. Drezner, Zvi, 2005. "The extended concentric tabu for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 160(2), pages 416-422, January.
    19. Siraj, Sajid & Mikhailov, Ludmil & Keane, John A., 2015. "Contribution of individual judgments toward inconsistency in pairwise comparisons," European Journal of Operational Research, Elsevier, vol. 242(2), pages 557-567.
    20. Monsuur, Herman, 2005. "Characterizations of the 3-cycle count and backward length of a tournament," European Journal of Operational Research, Elsevier, vol. 164(3), pages 778-784, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:35:y:2005:i:6:p:497-510. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.