About: Tournament solution

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property	Value
dbo:abstract	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 the best candidates are among all candidates. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/4-tournament.svg?width=300
dbo:wikiPageID	52307973 (xsd:integer)
dbo:wikiPageLength	5477 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1081656177 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Top_cycle dbr:Binary_relation dbr:Biology dbr:Bipartisan_set dbr:Connex_relation dbr:Function_(mathematics) dbr:Game_theory dbr:Copeland's_method dbr:Multi-armed_bandit dbr:Tournament_(graph_theory) dbr:Web_search_engine dbr:Graph_isomorphism dbr:Social_choice_theory dbc:Voting_theory dbr:Vertex_(graph_theory) dbr:Multi-Criteria_Decision_Analysis dbr:Subset dbr:Sports_competition dbr:File:4-tournament.svg
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Electoral_systems
dcterms:subject	dbc:Voting_theory
rdfs:comment	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. (en)
rdfs:label	Tournament solution (en)
owl:sameAs	wikidata:Tournament solution https://global.dbpedia.org/id/2eN26
prov:wasDerivedFrom	wikipedia-en:Tournament_solution?oldid=1081656177&ns=0
foaf:depiction	wiki-commons:Special:FilePath/4-tournament.svg
foaf:isPrimaryTopicOf	wikipedia-en:Tournament_solution
is dbo:wikiPageWikiLink of	dbr:Computational_social_choice dbr:Tournament_(graph_theory)
is foaf:primaryTopic of	wikipedia-en:Tournament_solution