A threshold for majority in the context of aggregating partial order relations
暂无分享,去创建一个
[1] P. Vincke. Exploitation of a crisp relation in a ranking problem , 1992 .
[2] P. Fishburn. SOCIAL CHOICE FUNCTIONS , 1974 .
[3] Bernard De Baets,et al. New operations for informative combination of two partial order relations with illustrations on pollution data. , 2008, Combinatorial chemistry & high throughput screening.
[4] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[5] P. Fishburn. Condorcet Social Choice Functions , 1977 .
[6] P. Fishburn. Paradoxes of Voting , 1974, American Political Science Review.
[7] Eyke Hüllermeier,et al. Label ranking by learning pairwise preferences , 2008, Artif. Intell..
[8] Bernard De Baets,et al. On the existence and construction of T-transitive closures , 2003, Inf. Sci..
[9] Eyke Hüllermeier,et al. Pairwise Preference Learning and Ranking , 2003, ECML.
[10] Bernard De Baets,et al. Algorithms for the computation of T-transitive closures , 2002, IEEE Trans. Fuzzy Syst..