![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/8/89/4-tournament.svg/640px-4-tournament.svg.png&w=640&q=50)
Tournament solution
From Wikipedia, the free encyclopedia
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,[1][2][3][4] but have also been considered in sports competition, game theory,[5] multi-criteria decision analysis, biology,[6][7] webpage ranking,[8] and dueling bandit problems.[9]
![]() | It has been suggested that this article be merged into Round-robin voting and Tournament (graph theory). (Discuss) Proposed since May 2024. |
In the context of social choice theory, tournament solutions are closely related to Fishburn's C1 social choice functions,[10] and thus seek to show who are the strongest candidates in some sense.
![](http://upload.wikimedia.org/wikipedia/commons/thumb/8/89/4-tournament.svg/220px-4-tournament.svg.png)