Abstract
The directed graphs in which every pair of vertices has exactly one arc joining them is called a tournament. They are used, e.g., in experiments involving paired comparisons, in round robin tournaments in which each player plays every other one, in studying pecking order in a barnyard or in an organization. Some natural questions that arise with these digraphs are: (i) Is there always a winner? (ii) Is there an ordering of the players determined by the tournament? (iii) If so, is it unique?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Walter, G.G., Contreras, M. (1999). Tournaments. In: Compartmental Modeling with Networks. Modeling and Simulation in Science, Engineering and Technology. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1590-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1590-5_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7207-6
Online ISBN: 978-1-4612-1590-5
eBook Packages: Springer Book Archive