UPSETS IN ROUND ROBIN TOURNAMENTS

Abstract

Considered is a round robin tournament in which each player plays one game with every other player, and assume that each game ends in a win for one of the players. The results of such a tournament can be recorded in a square (0, 1)matrix T = (t sub ij) by setting t sub ij = 1 or 0 according as player i defeats or loses to player j, and t sub ii = 0. This Memorandum studies the class of all tournament matrices having prescribed row sums r sub 1 < r sub 2 < ... < r sub n. In particular, simple constructions are given for two specific matrices in this class.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1964
Accession Number
AD0601366

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Applied Mathematics
  • Construction
  • Equations
  • Inequalities
  • Integrals
  • Intervals
  • Linear Programming
  • Mathematics
  • Operations Research
  • Sequences
  • Symmetry
  • United States

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design