Tournament solution

A tournament solution is a function that maps an oriented complete graph to a nonempty subset of its vertices. It can informally be thought of as a way to find the "best" alternatives among all of the alternatives that are "competing" against each other in the tournament. Tournament solutions originate from social choice theory, but have also been considered in sports competition, game theory, multi-criteria decision analysis, biology, webpage ranking, and dueling bandit problems.
In the context of social choice theory, tournament solutions are closely related to Fishburn's C1 social choice functions, and thus seek to show who are the strongest candidates in some sense.
Wikipedia contributors, "Tournament solution", Wikipedia, revision 1360443626, retrieved 20 November 2026, source, CC BY-SA 4.0.