The Copeland ratio ranking method for abstract decision problems
From MaRDI portal
Cites work
- Aggregation of preferences by the generalized row sum method
- An impossibility theorem for paired comparisons
- Characterization of dominance relations in finite coalitional games
- Characterizations of scoring methods for preference aggregation
- Condorcet Social Choice Functions
- Generalization of the row sum method for incomplete paired comparisons
- scientific article; zbMATH DE number 3972536 (Why is no real title available?)
- scientific article; zbMATH DE number 1086759 (Why is no real title available?)
- Multiple criteria decision analysis. State of the art surveys
- On different ranking methods
- On the ranking of a Swiss system chess team tournament
- Paired comparisons analysis: an axiomatic approach to ranking methods
- Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures
- Ranking by outdegree for directed graphs
- Ranking methods based on valued preference relations. A characterization of the net flow method
- Ranking the Participants in a Tournament
- Some impossibilities of ranking in generalized tournaments
- The Copeland choice function. An axiomatic characterization
- The degree ratio ranking method for directed graphs
- The outflow ranking method for weighted directed graphs
- Tournament solutions and majority voting
- University rankings from the revealed preferences of the applicants
Cited in
(2)
This page was built for publication: The Copeland ratio ranking method for abstract decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981783)
