Upsets in Round Robin Tournaments.

D. R. Fulkerson

ResearchPublished 1964

An examination of two problems concerning (0,1)-matrices in a round robin tournament in which each player plays one game with every other player and each game ends in a win for one of the players. Simple constructions are given for two specific matrices. Using the theory of minimal-cost flows in networks, results about the block structure are deduced

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1964
  • Pages: 32
  • Document Number: RM-4112-PR

Citation

Chicago Manual of Style

Fulkerson, D. R., Upsets in Round Robin Tournaments. Santa Monica, CA: RAND Corporation, 1964. https://www.rand.org/pubs/research_memoranda/RM4112.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.