Ranking the Participants in a Tournament
From MaRDI portal
Publication:3884130
DOI10.1137/0138009zbMath0442.05028OpenAlexW2076726514MaRDI QIDQ3884130
Publication date: 1980
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0138009
Related Items
The Copeland choice function. An axiomatic characterization ⋮ Axioms for centrality scoring with principal eigenvectors ⋮ Socially structured games ⋮ Choosing from a tournament ⋮ The socially stable core in structured transferable utility games ⋮ Weak covering relations ⋮ Condorcet-consistent and approximately strategyproof tournament rules ⋮ The efficacy of tournament designs ⋮ Measuring centrality by a generalization of degree ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On solving intransitivities in repeated pairwise choices ⋮ Local and consistent centrality measures in parameterized networks ⋮ Evolvement of influence in hierarchies ⋮ The degree measure as utility function over positions in graphs and digraphs ⋮ Mutual rankings ⋮ League competitions and fairness ⋮ An impossibility theorem for paired comparisons ⋮ Incomplete paired comparisons in case of multiple choice and general log-concave probability density functions ⋮ Centrality measures in networks ⋮ Ranking by outdegree for directed graphs ⋮ On incentive compatible competitive selection protocols ⋮ Choice and individual welfare ⋮ On two new social choice correspondences. ⋮ Some Impossibilities of Ranking in Generalized Tournaments ⋮ Can strategizing in round-robin subtournaments be avoided? ⋮ Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking ⋮ A note on the sum of differences choice function for fuzzy preference relations ⋮ Ranking participants in tournaments by means of rating functions ⋮ Ranking methods based on valued preference relations. A characterization of the net flow method ⋮ Paired comparisons analysis: an axiomatic approach to ranking methods ⋮ Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows ⋮ The outflow ranking method for weighted directed graphs ⋮ Strategic manipulation in tournament games ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the (numerical) ranking associated with any finite binary relation ⋮ The selection efficiency of tournaments ⋮ A characterization of the Copeland solution ⋮ Scoring of web pages and tournaments-axiomatizations ⋮ The degree ratio ranking method for directed graphs ⋮ On the monotonicity of the eigenvector method ⋮ Axiomatizations of the \(\beta\) and the score measures in networks ⋮ Measuring intransitivity ⋮ Ranking whist players ⋮ Resistance and conductance in structured Zermelo tournaments ⋮ Rough approximation of a preference relation by dominance relations ⋮ Round-robin tournaments with limited resources ⋮ A graph interpretation of the least squares ranking method ⋮ On Different Ranking Methods ⋮ Ranking the Vertices of a Paired Comparison Digraph
