This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and concepts from Graph Theory, Choice Theory, Decision Science and Social Choice which were discovered in the last ten years. Classical scoring and ranking methods are introduced, including the Slater orderings, as well as new statistical methods for describing a tournament, graph-theoretical methods based on the covering relation and game-theoretical methods. As an illustration, results are applied to the classical problem of Majority Voting: How to deal with the Condorcet Paradox.This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and concepts from Graph Theory, Choice Theory, Decision Science and Social Choice which were discovered in the last ten years. Classical scoring and ranking methods are introduced, including the Slater orderings, as well as new statistical methods for describing a tournament, graph-theoretical methods based on the covering relation and game-theoretical methods. As an illustration, results are applied to the classical problem of Majority Voting: How to deal with the Condorcet Paradox.Organisation of the Book.- 1 Generalities.- 1.1 Definitions and Notations ..- 1.2 Finite Tournaments.- 1.3 Decomposition.- 1.4 Regularity.- 1.5 Useful Notions about General Binary Relations.- 2 Tournament Solutions.- 2.1 Majority Voting and Tournaments.- 2.2 Solution Concepts.- 2.3 Monotonicity, Strong Superset Property and Independence of Losers.- 2.4 Composition-Consistency and Regularity.- 2.5 Composition-Consistent Hulls.- 3 Scoring and Ranking Methods.- 3.1 Copeland Solution.- 3.2 Iterative Matrix Solutions.- 3.3 Markov Solution.- 3.4 Slater Solution.- 4 Multivariate Descriptions.- 4.1 Complete Euclidean Description.- 4.2 Multidimensional Scaling.- 5 Covering.- 5.1 Covering Relation and Uncovered Set.- 5.2 Iterations of thelc/