Ranking participants in generalized tournaments

DOI10.1007/S00182-005-0197-5MaRDI QIDQ2487968zbMATH OpenOpenAlexFDO

Authors Oscar Volij, Giora Slutzki

Publication date 17 August 2005

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00182-005-0197-5

zbMATH Keywords

Perron-Frobenius theoremBirkhoff's theoremscoring methods

Mathematics Subject Classification ID

Voting theory (91B12)

Recommendations

• Ranking participants in tournaments by means of rating functions
• Some impossibilities of ranking in generalized tournaments
• Ranking Tournaments
• The first-order approach in rank-order tournaments
• Ordinally consistent set-ranking methods for tournaments
• Ranking by pairwise comparisons for Swiss-system tournaments
• Ranking players in multiple tournaments
• A constructive solution to a problem of ranking tournaments
• On generalized competition index of a primitive tournament

Cited in

(14)

• The flow network method
• Comparing the efficacy of ranking methods for multiple round-robin tournaments
• Paired comparisons analysis: an axiomatic approach to ranking methods
• Ranking participants in tournaments by means of rating functions
• Rank-order tournaments and selection.
• Axioms for centrality scoring with principal eigenvectors
• On different ranking methods
• A stochastic method for exploiting outranking relations in multicriteria choice problems
• Networks, information and choice
• University rankings from the revealed preferences of the applicants
• Some impossibilities of ranking in generalized tournaments
• Ordinally consistent set-ranking methods for tournaments
• On incentive compatible competitive selection protocols
• Axiomatic characterizations of the core and the Shapley value of the broadcasting game

This page was built for publication: Ranking participants in generalized tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487968)