The Copeland choice function. An axiomatic characterization

From MaRDI portal
Publication:1082226


DOI10.1007/BF00433767zbMath0602.90010MaRDI QIDQ1082226

Dominique Henriet

Publication date: 1985

Published in: Social Choice and Welfare (Search for Journal in Brave)



Related Items

Extending tournament solutions, Axioms for centrality scoring with principal eigenvectors, Choosing from a tournament, Canonical fuzzy bags and bag fuzzy measures as a basis for MADM with mixed non cardinal data, Weak covering relations, A refinement of the uncovered set in tournaments, A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules, Local and consistent centrality measures in parameterized networks, Voting: a machine learning approach, The degree measure as utility function over positions in graphs and digraphs, An impossibility theorem for paired comparisons, Centrality measures in networks, Ranking by outdegree for directed graphs, On two new social choice correspondences., Positionalist voting rules: a general definition and axiomatic characterizations, 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 methods based on valued preference relations. A characterization of the net flow method, 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, On the (numerical) ranking associated with any finite binary relation, 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, Weighted committee games, Axiomatizations of the \(\beta\) and the score measures in networks, A new decision making model based on rank centrality for GDM with fuzzy preference relations, Rough approximation of a preference relation by dominance relations, On Different Ranking Methods



Cites Work